Cover Image

Stabilized Proximal Point Method via Trust Region Control

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Hanmin, Gruntkowska, Kaja, Richtárik, Peter
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control 90C25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Power of Extrapolation in Federated Learning
by: Li, Hanmin, et al.
Published: (2024)

On the Convergence of FedProx with Extrapolation and Inexact Prox
by: Li, Hanmin, et al.
Published: (2024)

The Ball-Proximal (="Broximal") Point Method: a New Algorithm, Convergence Theory, and Applications
by: Gruntkowska, Kaja, et al.
Published: (2025)

Local LMO: Constrained Gradient Optimization via a Local Linear Minimization Oracle
by: Richtárik, Peter, et al.
Published: (2026)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
by: Zhang, Liwei, et al.
Published: (2025)

Communication Compression for Byzantine Robust Learning: New Efficient Algorithms and Improved Rates
by: Rammal, Ahmad, et al.
Published: (2023)

Variance Reduced Distributed Non-Convex Optimization Using Matrix Stepsizes
by: Li, Hanmin, et al.
Published: (2023)

Det-CGD: Compressed Gradient Descent with Matrix Stepsizes for Non-Convex Optimization
by: Li, Hanmin, et al.
Published: (2023)

Non-Euclidean Broximal Point Method: A Blueprint for Geometry-Aware Optimization
by: Gruntkowska, Kaja, et al.
Published: (2025)

Broximal Alignment for Global Non-Convex Optimization
by: Gruntkowska, Kaja, et al.
Published: (2026)

A Riemannian Accelerated Proximal Gradient Method
by: Feng, Shuailing, et al.
Published: (2025)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
by: Traoré, Cheik, et al.
Published: (2025)

A Trust Region Proximal Gradient Method for Nonlinear Multi-objective Optimization Problems
by: Ansary, Md Abu Talhamainuddin
Published: (2024)

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization
by: Hamana, Shodai, et al.
Published: (2026)

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
by: Fersztand, David, et al.
Published: (2024)

SPAM: Stochastic Proximal Point Method with Momentum Variance Reduction for Non-convex Cross-Device Federated Learning
by: Karagulyan, Avetik, et al.
Published: (2024)

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
by: Yang, Lei, et al.
Published: (2023)

Asymmetric Long-Step Primal-Dual Interior-Point Methods with Dual Centering
by: Nesterov, Yurii
Published: (2025)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
by: Chen, Jian, et al.
Published: (2026)

On Convergence and Stability of Two Extended BB-like Step Sizes
by: Xu, Xin
Published: (2025)

A Parameterized Barzilai-Borwein Method via Interpolated Least Squares
by: Xu, Xin
Published: (2024)

Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
by: Jiang, Ruichen, et al.
Published: (2022)

Lipschitz-free Projected Subgradient Method with Time-varying Step-size
by: Xia, Yong, et al.
Published: (2024)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
by: Zhu, Zhihan, et al.
Published: (2024)

A Linear Convergence Result for the Jacobi-Proximal Alternating Direction Method of Multipliers
by: Choi, Hyelin, et al.
Published: (2025)

Local and Global Convergence of Greedy Parabolic Target-Following Methods for Linear Programming
by: Nesterov, Yurii
Published: (2024)

A Class of Accelerated Fixed-Point-Based Methods with Delayed Inexact Oracles and Its Applications
by: Nguyen-Trung, Nghia, et al.
Published: (2025)

Parallelizing the Circumcentered-Reflection Method
by: Barros, Pablo, et al.
Published: (2025)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

On Convergence of Regularized Barzilai-Borwein Method
by: Xu, Xin
Published: (2025)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
by: Cifuentes, Diego, et al.
Published: (2026)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
by: García-Castaño, Fernando, et al.
Published: (2024)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
by: Song, Yongcun, et al.
Published: (2024)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
by: Wang, Alex L.
Published: (2025)

Stochastic Variance-Reduced Forward-Reflected-Backward Splitting Methods for Nonmonotone Generalized Equations
by: Tran-Dinh, Quoc
Published: (2024)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
by: Giang-Tran, Khanh-Hung, et al.
Published: (2023)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
by: Namchaisiri, Charles, et al.
Published: (2024)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
by: Chen, Kaihuang, et al.
Published: (2025)