Metraipolis › archive › dc_dcf2cdb4fdc1

An Adaptive Cubic Regularisation Algorithm Based on Interior-Point Methods for Optimization with General Inequality Constraints — arXiv:2610.21673

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.21673
License (as archived)
CC0-1.0
Archived
2026-10-16T10:28:41.153Z
SHA-256 of the archived text
b12747730894ac5ccf8003b874432ad24d0df6d62d23e7a6a8019bd631b6f999
Stable URL of this page
https://metraipolis.com/documento/dc_dcf2cdb4fdc1

How to cite

An Adaptive Cubic Regularisation Algorithm Based on Interior-Point Methods for Optimization with General Inequality Constraints — arXiv:2610.21673 — arXiv (en), https://arxiv.org/abs/2610.21673 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dcf2cdb4fdc1 (Metraipolis archive dc_dcf2cdb4fdc1, sha256 b12747730894ac5ccf8003b874432ad24d0df6d62d23e7a6a8019bd631b6f999)
BibTeX
@misc{dcdcf2cdb4fdc1,
  title = {An Adaptive Cubic Regularisation Algorithm Based on Interior-Point Methods for Optimization with General Inequality Constraints — arXiv:2610.21673},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.21673},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dcf2cdb4fdc1; sha256 b12747730894ac5ccf8003b874432ad24d0df6d62d23e7a6a8019bd631b6f999},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21673. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Nonlinear constrained optimization has a wide range of practical applications. The interior-point method is considered to be one of the most powerful algorithms for solving nonlinear inequality constrained optimization. In this paper, we consider optimization with general inequality constraints and propose an Adaptive Regularisation algorithm using Cubics Based on Interior-Point methods (ARCBIP). For solving the barrier problem, we construct ARC subproblem with linearized constraints and the well-known fraction to the boundary rule that prevents slack variables from approaching their lower bounds prematurely. We employ a composite-step approach and reduced Hessian methods to deal with linearized constraints, where the trial step is decomposed into a normal step and a tangential step. They are obtained by solving two ARC subproblems approximately with the fraction to the boundary rule. Requirements on normal steps and tangential steps are given to ensure global convergence. To determine whether the trial step is accepted, we use exact penalty function as the merit function in ARC framework. The updating of the barrier parameter is implemented by adaptive strategies. Global convergence is analyzed under mild assumptions. Preliminary numerical experiments and some comparison results are reported.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.21673 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:49:47.929Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).