Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Gauss–Newton optimization | Statement: [Lucas–Kanade optical flow algorithm, mathematicalTool, Gauss–Newton optimization]

Target entity: Gauss–Newton optimization
Context triple: [Lucas–Kanade optical flow algorithm, mathematicalTool, Gauss–Newton optimization]

• A. Newton’s method
  Newton’s method is an iterative numerical technique used to find successively better approximations to the roots of a real-valued function.
• B. Adam: A Method for Stochastic Optimization
  "Adam: A Method for Stochastic Optimization" is a highly influential machine learning paper that introduces the Adam optimizer, a widely used adaptive gradient-based optimization algorithm for training deep neural networks.
• C. Successive Over-Relaxation
  Successive Over-Relaxation is an iterative numerical method that accelerates the convergence of the Gauss–Seidel algorithm for solving large systems of linear equations by introducing a relaxation factor.
• D. “Stochastic Gradient Descent Tricks”
  “Stochastic Gradient Descent Tricks” is a well-known paper by Léon Bottou that surveys practical techniques and heuristics for effectively applying stochastic gradient descent in machine learning.
• E. Godunov's method
  Godunov's method is a numerical scheme for solving hyperbolic partial differential equations that uses exact or approximate Riemann solvers to compute fluxes at cell interfaces in finite-volume discretizations.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Gauss–Newton optimization
Triple: [Lucas–Kanade optical flow algorithm, mathematicalTool, Gauss–Newton optimization]

Gauss–Newton optimization is an iterative numerical method for solving non-linear least squares problems by repeatedly linearizing the model around the current estimate and updating parameters to minimize the squared error.

Target entity: Gauss–Newton optimization
Target entity description: Gauss–Newton optimization is an iterative numerical method for solving non-linear least squares problems by repeatedly linearizing the model around the current estimate and updating parameters to minimize the squared error.

• A. Newton’s method
  Newton’s method is an iterative numerical technique used to find successively better approximations to the roots of a real-valued function.
• B. Adam: A Method for Stochastic Optimization
  "Adam: A Method for Stochastic Optimization" is a highly influential machine learning paper that introduces the Adam optimizer, a widely used adaptive gradient-based optimization algorithm for training deep neural networks.
• C. Successive Over-Relaxation
  Successive Over-Relaxation is an iterative numerical method that accelerates the convergence of the Gauss–Seidel algorithm for solving large systems of linear equations by introducing a relaxation factor.
• D. “Stochastic Gradient Descent Tricks”
  “Stochastic Gradient Descent Tricks” is a well-known paper by Léon Bottou that surveys practical techniques and heuristics for effectively applying stochastic gradient descent in machine learning.
• E. Godunov's method
  Godunov's method is a numerical scheme for solving hyperbolic partial differential equations that uses exact or approximate Riemann solvers to compute fluxes at cell interfaces in finite-volume discretizations.
• F. None of above. chosen