Metraipolis › archive › dc_7de807377078
Dynamic Proximal Point Method for Unconstrained Minimization — arXiv:2608.03349
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.03349
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:48:29.405Z
- SHA-256 of the archived text
47b690cb2d2553905dceb46d5e43fc68472809515fd31833a4a67442bcf99430- Stable URL of this page
https://metraipolis.com/documento/dc_7de807377078
How to cite
Dynamic Proximal Point Method for Unconstrained Minimization — arXiv:2608.03349 — arXiv (en), https://arxiv.org/abs/2608.03349 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7de807377078 (Metraipolis archive dc_7de807377078, sha256 47b690cb2d2553905dceb46d5e43fc68472809515fd31833a4a67442bcf99430)
BibTeX
@misc{dc7de807377078,
title = {Dynamic Proximal Point Method for Unconstrained Minimization — arXiv:2608.03349},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.03349},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7de807377078; sha256 47b690cb2d2553905dceb46d5e43fc68472809515fd31833a4a67442bcf99430},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03349. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this work, we present a novel dynamic proximal point algorithm for unconstrained optimization. The method generates a sequence of proximal subproblems, where the quadratic regularization term is weighted by a diagonal matrix that is updated adaptively at each iteration. Each subproblem is solved using an inner Newton's method combined with a line search, which provides a global convergence mechanism for the nonlinear solver. At the outer level, the algorithm updates the reference point and adjusts the regularization parameter based on the performance of the inner Newton solver. We derive the reduced linear system used to compute the Newton step, define the corresponding merit function, and discuss practical approaches for constructing the diagonal scaling matrix from derivative information. The paper also provides implementation-oriented pseudocode and stopping criteria that are consistent with the proposed method. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-05 in math.OC). Categorie arXiv: Optimization and Control (math.OC) ; Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2608.03349 — 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-31T12:35:48.811Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).