A line search filter sequential adaptive cubic regularisation algorithm for nonlinearly constrained optimization
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908358338936832 |
|---|---|
| author | Pei, Yonggang Wang, Jingyi Song, Shaofang Gao, Qinghui Zhu, Detong |
| author_facet | Pei, Yonggang Wang, Jingyi Song, Shaofang Gao, Qinghui Zhu, Detong |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_04784 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A line search filter sequential adaptive cubic regularisation algorithm for nonlinearly constrained optimization Pei, Yonggang Wang, Jingyi Song, Shaofang Gao, Qinghui Zhu, Detong Optimization and Control 49M37, 65K05, 65K10, 90C30 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. |
| title | A line search filter sequential adaptive cubic regularisation algorithm for nonlinearly constrained optimization |
| topic | Optimization and Control 49M37, 65K05, 65K10, 90C30 |
| url | https://arxiv.org/abs/2409.04784 |