Stabilized Proximal Point Method via Trust Region Control
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914442908794880 |
|---|---|
| author | Li, Hanmin Gruntkowska, Kaja Richtárik, Peter |
| author_facet | Li, Hanmin Gruntkowska, Kaja Richtárik, Peter |
| contents | The Proximal Point Method (PPM) (Rockafellar, 1976) is a fundamental tool for nonsmooth convex optimization. However, its convergence is not linear under general convexity in the absence of strong convexity or other structural assumptions. To address this limitation, we study a trust-region stabilized proximal point scheme in which each proximal update is computed over a localized feasible region. We show that this simple stabilization enforces non-vanishing steps and yields a linear decrease in objective values outside any prescribed neighborhood, without assuming smoothness or strong convexity. Our analysis identifies a displacement condition as the key driver of linear descent and provides two complementary parameter regimes to guarantee it: fixing the trust-region radius and choosing the regularization properly, or fixing the regularization and selecting radii via a uniform displacement lower bound. We further give explicit characterization of the linear regime conditions respectively, and prove that the trust-region is redundant under strong convexity, Finally, we establish an exact equivalence with the Broximal Point Method (BPM) (Gruntkowska et al., 2025) in the active constraint regime. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_02943 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Stabilized Proximal Point Method via Trust Region Control Li, Hanmin Gruntkowska, Kaja Richtárik, Peter Optimization and Control 90C25 The Proximal Point Method (PPM) (Rockafellar, 1976) is a fundamental tool for nonsmooth convex optimization. However, its convergence is not linear under general convexity in the absence of strong convexity or other structural assumptions. To address this limitation, we study a trust-region stabilized proximal point scheme in which each proximal update is computed over a localized feasible region. We show that this simple stabilization enforces non-vanishing steps and yields a linear decrease in objective values outside any prescribed neighborhood, without assuming smoothness or strong convexity. Our analysis identifies a displacement condition as the key driver of linear descent and provides two complementary parameter regimes to guarantee it: fixing the trust-region radius and choosing the regularization properly, or fixing the regularization and selecting radii via a uniform displacement lower bound. We further give explicit characterization of the linear regime conditions respectively, and prove that the trust-region is redundant under strong convexity, Finally, we establish an exact equivalence with the Broximal Point Method (BPM) (Gruntkowska et al., 2025) in the active constraint regime. |
| title | Stabilized Proximal Point Method via Trust Region Control |
| topic | Optimization and Control 90C25 |
| url | https://arxiv.org/abs/2604.02943 |