Metraipolis › archive › dc_f4d9f669a8a4
Interior-point proximal methods for nonsmooth optimization in Hilbert spaces with cone-ordered constraints — arXiv:2609.13813
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.13813
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T00:39:11.318Z
- SHA-256 of the archived text
498a5b889745dae5375312b128e9736061dba4438eca8a05e505ce44a3a90741- Stable URL of this page
https://metraipolis.com/documento/dc_f4d9f669a8a4
How to cite
Interior-point proximal methods for nonsmooth optimization in Hilbert spaces with cone-ordered constraints — arXiv:2609.13813 — arXiv (en), https://arxiv.org/abs/2609.13813 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f4d9f669a8a4 (Metraipolis archive dc_f4d9f669a8a4, sha256 498a5b889745dae5375312b128e9736061dba4438eca8a05e505ce44a3a90741)
BibTeX
@misc{dcf4d9f669a8a4,
title = {Interior-point proximal methods for nonsmooth optimization in Hilbert spaces with cone-ordered constraints — arXiv:2609.13813},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.13813},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f4d9f669a8a4; sha256 498a5b889745dae5375312b128e9736061dba4438eca8a05e505ce44a3a90741},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13813. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study an inexact interior-point method for nonsmooth, possibly nonconvex optimization in a Hilbert space with inequality constraints ordered by a cone in a Banach lattice, with particular emphasis on infinite-dimensional state-constrained optimal control. The objective function is given by the sum of a smooth, possibly nonconvex term and a convex, possibly nonsmooth term with a computable proximal mapping. The constraints are formulated by means of an order cone in a Banach lattice. This setting covers finite-dimensional nonsmooth nonlinear problems with componentwise constraints as well as infinite-dimensional PDE-constrained optimization problems with pointwise state constraints. The method is based on barrier-regularized subproblems, which are solved inexactly by a proximal-gradient method. We consider logarithmic and power-type barriers and derive the differentiability and curvature estimates needed for the convergence and complexity analysis. Under suitable constraint qualifications and compactness assumptions, we establish approximate KKT conditions for the original problem and convergence of the inexact interior-point sequence. For logarithmic and power-type barriers, we derive complementarity estimates and outer iteration bounds; the corresponding power-barrier rates and total inner-outer complexity bounds are stated under explicit barrier-path and uniform smoothness assumptions. For convex problems, we obtain stronger convergence results. We apply the framework to state-constrained semilinear elliptic optimal control and sparse dictionary learning with nonlinear side constraints. Numerical experiments illustrate the proposed method. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.OC). Categorie arXiv: Optimization and Control (math.OC) ; Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2609.13813 — 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-16T00:16:48.803Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).