Metraipolis › archive › dc_d3f6cfc9bb73
Second-order optimality conditions for $C^{1,1}$ sparsity constrained optimization problems via disjunctive programming — arXiv:2611.09146
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.09146
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:42:30.556Z
- SHA-256 of the archived text
c1e4f679329ffd8ca4cf8b6cfff432b31b21514065ae4e44ff9179f426f37685- Stable URL of this page
https://metraipolis.com/documento/dc_d3f6cfc9bb73
How to cite
Second-order optimality conditions for $C^{1,1}$ sparsity constrained optimization problems via disjunctive programming — arXiv:2611.09146 — arXiv (en), https://arxiv.org/abs/2611.09146 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d3f6cfc9bb73 (Metraipolis archive dc_d3f6cfc9bb73, sha256 c1e4f679329ffd8ca4cf8b6cfff432b31b21514065ae4e44ff9179f426f37685)
BibTeX
@misc{dcd3f6cfc9bb73,
title = {Second-order optimality conditions for $C^1,1$ sparsity constrained optimization problems via disjunctive programming — arXiv:2611.09146},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.09146},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d3f6cfc9bb73; sha256 c1e4f679329ffd8ca4cf8b6cfff432b31b21514065ae4e44ff9179f426f37685},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09146. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we investigate second-order necessary and sufficient optimality conditions for a class of $C^{1,1}$ sparsity constrained optimization problems via a disjunctive programming approach. More precisely, by utilizing the limiting/Mordukhovich second-order subdifferential of the associated Lagrangian function, we establish new second-order necessary and sufficient optimality conditions for local optimal solutions. These results are derived under mild assumptions and extend several existing results in the literature. In addition, we apply our theoretical developments to sparse multiobjective optimization problems and derive second-order optimality conditions for efficient solutions.
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/2611.09146 — 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-09T22:35:32.250Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).