Trust region algorithms for the nonlinear least distance problem (Q1893536): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3690580 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3681854 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3330984 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4226179 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A trust region method for implicit orthogonal distance regression / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4083217 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A trust region algorithm for equality constrained optimization / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02143933 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1968077169 / rank | |||
Normal rank |
Latest revision as of 11:14, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Trust region algorithms for the nonlinear least distance problem |
scientific article |
Statements
Trust region algorithms for the nonlinear least distance problem (English)
0 references
4 February 1996
0 references
This paper discusses the nonlinear least distance problem, which is a special case of equality constrained optimization. Let a curve or surface be given in implicit form via the equation \(f(x)= 0\), \(x\in \mathbb{R}^d\), and let \(z\in \mathbb{R}^d\) be a fixed data point. This paper discusses two algorithms for solving the following problem: Find a point \(x^*\) such that \(f(x^*)= 0\) and \(|z- x^*|_2\) is minimal among all such \(x\). The algorithms presented use the trust region approach in which, at each iteration, an approximation to the objective function or merit function is given in the neighborhood (the trust region) of the current iterate. Among other things, this allows one to prove global convergence of the algorithm.
0 references
trust region algorithms
0 references
nonlinear least distance problem
0 references
equality constrained optimization
0 references
global convergence
0 references