A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization
NUMERICAL ALGORITHMS(2022)
Abstract
In this paper, we propose a filter sequential adaptive regularization algorithm using cubics (ARC) for solving nonlinear equality constrained optimization. Similar to sequential quadratic programming methods, an ARC subproblem with linearized constraints is considered to obtain a trial step in each iteration. Composite step methods and reduced Hessian methods are employed to tackle the linearized constraints. As a result, a trial step is decomposed into the sum of a normal step and a tangential step which is computed by a standard ARC subproblem. Then, the new iteration is determined by filter methods and ARC framework. The global convergence of the algorithm is proved under some reasonable assumptions. Preliminary numerical experiments and comparison results are reported.
MoreTranslated text
Key words
Nonlinear constrained optimization,Cubic regularization,Filter methods,Sequential quadratic programming,Global convergence
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined