A line search filter sequential adaptive cubic regularisation algorithm for nonlinearly constrained optimization

In this paper, a sequential adaptive regularization algorithm using cubics (ARC) is presented to solve nonlinear equality constrained optimization. It is motivated by the idea of handling constraints in sequential quadratic programming methods. In each iteration, we decompose the new step into the s...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2024-09
Main Authors: Pei, Yonggang, Song, Shaofang, Chen, Yanyan, Zhu, Detong
Format: Article
Language:English
Subjects:
Adaptive algorithms
Constraints
Optimization
Quadratic programming
Regularization
Searching
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, a sequential adaptive regularization algorithm using cubics (ARC) is presented to solve nonlinear equality constrained optimization. It is motivated by the idea of handling constraints in sequential quadratic programming methods. In each iteration, we decompose the new step into the sum of the normal step and the tangential step by using composite step approaches. Using a projective matrix, we transform the constrained ARC subproblem into a standard ARC subproblem which generates the tangential step. After the new step is computed, we employ line search filter techniques to generate the next iteration point. Line search filter techniques enable the algorithm to avoid the difficulty of choosing an appropriate penalty parameter in merit functions and the possibility of solving ARC subproblem many times in one iteration in ARC framework. Global convergence is analyzed under some mild assumptions. Preliminary numerical results and comparison are reported.
ISSN:2331-8422