Nonlinear programming without a penalty function or a filter
A new method is introduced for solving equality constrained nonlinear optimization problems. This method does not use a penalty function, nor a barrier or a filter, and yet can be proved to be globally convergent to first-order stationary points. It uses different trust-regions to cope with the nonl...
Автори: | Gould, N, Toint, P |
---|---|
Формат: | Report |
Опубліковано: |
Unspecified
2007
|
Схожі ресурси
Схожі ресурси
-
On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming.
за авторством: Cartis, C, та інші
Опубліковано: (2011) -
Objective penalty function method for nonlinear programming with inequality constraints
за авторством: Zhuolin Yan, та інші
Опубліковано: (2024-11-01) -
On the evaluation complexity of constrained nonlinear least-squares and general constrained nonlinear optimization using second-order methods
за авторством: Cartis, C, та інші
Опубліковано: (2015) -
On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
за авторством: Cartis, C, та інші
Опубліковано: (2013) -
On the complexity of finding first-order critical points in constrained nonlinear optimization
за авторством: Cartis, C, та інші
Опубліковано: (2012)