Metraipolis › archive › dc_5cc5e2c14fb8
A Feasible-Direction-Type Method for Nonconvex Optimization with Infeasible Starts — arXiv:2610.38842
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.38842
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:32:08.333Z
- SHA-256 of the archived text
f0d28b3f19426a978426b3b49d31b4782f5ba8c299c57fc2c540cab941ae0d43- Stable URL of this page
https://metraipolis.com/documento/dc_5cc5e2c14fb8
How to cite
A Feasible-Direction-Type Method for Nonconvex Optimization with Infeasible Starts — arXiv:2610.38842 — arXiv (en), https://arxiv.org/abs/2610.38842 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5cc5e2c14fb8 (Metraipolis archive dc_5cc5e2c14fb8, sha256 f0d28b3f19426a978426b3b49d31b4782f5ba8c299c57fc2c540cab941ae0d43)
BibTeX
@misc{dc5cc5e2c14fb8,
title = {A Feasible-Direction-Type Method for Nonconvex Optimization with Infeasible Starts — arXiv:2610.38842},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.38842},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5cc5e2c14fb8; sha256 f0d28b3f19426a978426b3b49d31b4782f5ba8c299c57fc2c540cab941ae0d43},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38842. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We develop an infeasible-start extension of the Topkis--Veinott feasible-direction method for nonconvex composite optimization. At each main iteration, a strongly convex local model is used to obtain objective descent while limiting increases in constraint violation. A separate feasibility-reduction step is invoked when feasibility improvement is needed. Under a feasibility-reduction condition, we establish the standard first-order rate for reducing the Fritz John residual and constraint violation. We then verify that both proximal-gradient and regularized Gauss--Newton methods applied to minimizing the squared constraint-violation function satisfy the required feasibility-reduction property under a Polyak--Łojasiewicz condition. Numerical experiments compare the reduction methods, including an experimental prox-linear variant, and compare the scalar-regularized and curvature-enhanced subproblem formulations. 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.38842 — 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-11-01T02:14:28.306Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).