2005
DOI: 10.1007/s10107-004-0560-5
|View full text |Cite
|
Sign up to set email alerts
|

An interior algorithm for nonlinear optimization that combines line search and trust region steps

Abstract: An interior-point method for nonlinear programming is presented. It enjoys the flexibility of switching between a line search method that computes steps by factoring the primal-dual equations and a trust region method that uses a conjugate gradient iteration. Steps computed by direct factorization are always tried first, but if they are deemed ineffective, a trust region iteration that guarantees progress toward stationarity is invoked. To demonstrate its effectiveness, the algorithm is implemented in the Knit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
425
0
7

Year Published

2006
2006
2017
2017

Publication Types

Select...
8
1
1

Relationship

0
10

Authors

Journals

citations
Cited by 903 publications
(476 citation statements)
references
References 28 publications
1
425
0
7
Order By: Relevance
“…First, we remark that in our analysis we use only small perpendicular and temporal baseline interferograms because the large baseline ones do not contribute with relevant information in equation (2), since the corresponding w k (·) values are very small (Zebker and Villasenor 1992). Second, we underline that the minimization of the non-linear functional in (2) can be performed by using one of the several non-linear optimization routines available in literature (Kirkpatrick et al 1983, Zhu et al 1997, Waltz et al 2006. In particular, in this work we use the solver developed by Zhu et al (1997), which implements a limited memory quasi-Newton approach that is particularly suitable to solve constrained/unconstrained large non-linear optimization problems, by guaranteeing stable results and high computational efficiency.…”
Section: Interferogram Noise-filtering Algorithmmentioning
confidence: 99%
“…First, we remark that in our analysis we use only small perpendicular and temporal baseline interferograms because the large baseline ones do not contribute with relevant information in equation (2), since the corresponding w k (·) values are very small (Zebker and Villasenor 1992). Second, we underline that the minimization of the non-linear functional in (2) can be performed by using one of the several non-linear optimization routines available in literature (Kirkpatrick et al 1983, Zhu et al 1997, Waltz et al 2006. In particular, in this work we use the solver developed by Zhu et al (1997), which implements a limited memory quasi-Newton approach that is particularly suitable to solve constrained/unconstrained large non-linear optimization problems, by guaranteeing stable results and high computational efficiency.…”
Section: Interferogram Noise-filtering Algorithmmentioning
confidence: 99%
“…The scale dependence of such a parameter is not ideal, but a bound similar to (3.5b) is used to ensure the boundedness of the penalty parameter π k (as we show in Lemma 4.7) if the rule (3.6) is enforced. Since such a method for setting the penalty parameter has proved to work well in practice [23], we employ this update rule in the algorithms in this paper and define β and (3.5b) as given. The constants (τ, σ, η) can generally be set to default values, or, in the case of σ, to promote consistency between Termination Tests I and II.…”
Section: 1mentioning
confidence: 99%
“…Loqo [33] implements a line search primal-dual algorithm that can be viewed as a direct extension of interior methods for linear and quadratic programming. The first release of Knitro [6] offered a trust region interior-point algorithm employing a conjugate gradient iteration in the step computation; the second release added a line search interior algorithm that is safeguarded by the trust region approach [38]. Barnlp [2] and Ipopt [36] implement line search interior-point approaches; Ipopt uses a filter globalization and includes a feasibility restoration phase.…”
Section: Introductionmentioning
confidence: 99%