Copertina

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chen, Jian, Yang, Xinmin
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control 65K05, 90C25, 90C30
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
di: Fang, Changjie, et al.
Pubblicazione: (2025)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
di: Bao, Chenglong, et al.
Pubblicazione: (2024)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
di: Bollapragada, Raghu, et al.
Pubblicazione: (2025)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
di: Bao, Chenglong, et al.
Pubblicazione: (2023)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
di: Xie, Xiyuan, et al.
Pubblicazione: (2025)

Extragradient method with feasible inexact projection to variational inequality problem
di: Millán, R. Díaz, et al.
Pubblicazione: (2023)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
di: Zhou, Juan, et al.
Pubblicazione: (2024)

On the convergence of proximal gradient methods for convex simple bilevel optimization
di: Latafat, Puya, et al.
Pubblicazione: (2023)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
di: Xie, Pengcheng, et al.
Pubblicazione: (2023)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
di: Hu, Wei, et al.
Pubblicazione: (2026)

A Proximal-Gradient Method for Constrained Optimization
di: Dai, Yutong, et al.
Pubblicazione: (2024)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
di: Li, Qia, et al.
Pubblicazione: (2024)

Nonsmooth Projection-Free Optimization with Functional Constraints
di: Asgari, Kamiar, et al.
Pubblicazione: (2023)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
di: Takahashi, Shota, et al.
Pubblicazione: (2025)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
di: Curtis, Frank E., et al.
Pubblicazione: (2025)

Relaxed Weak Accelerated Proximal Gradient Method: a Unified Framework for Nesterov's Accelerations
di: Li, Hongda, et al.
Pubblicazione: (2025)

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

On Averaging and Extrapolation for Gradient Descent
di: Luner, Alan, et al.
Pubblicazione: (2024)

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

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

Adaptive Inertial Method
di: Long, Han, et al.
Pubblicazione: (2025)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
di: Millán, R. Díaz, et al.
Pubblicazione: (2026)

A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems
di: Kamijima, Tomoya, et al.
Pubblicazione: (2025)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
di: Gu, Ran, et al.
Pubblicazione: (2021)

A Stochastic Implicit Proximal Point Algorithm for Solving Linearly Constrained Stochastic Minimax Problems
di: Zhu, Kehan, et al.
Pubblicazione: (2026)

A cut-and-project perspective for linearized Bregman iterations
di: Dai, Yu-Hong, et al.
Pubblicazione: (2024)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
di: Marumo, Naoki
Pubblicazione: (2025)

BUP-TR: Bayesian Underdetermined Projection Trust-Region Methods for Derivative-Free Optimization
di: Hu, Wei, et al.
Pubblicazione: (2026)

Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search
di: Brilli, Andrea, et al.
Pubblicazione: (2024)

The Grimmer--Shu--Wang Certificate and the Drori--Teboulle Minimax Constant-Stepsize Bound for $N\ge 3$
di: Zhang, Lixing
Pubblicazione: (2026)

MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization
di: Li, Luxuan, et al.
Pubblicazione: (2026)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
di: Niu, Yi-Shuai, et al.
Pubblicazione: (2018)

A MINRES-based Linesearch Algorithm for Nonconvex Optimization with Non-positive Curvature Detection
di: Zeng, Hanfeng, et al.
Pubblicazione: (2026)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
di: He, Jiahuan, et al.
Pubblicazione: (2023)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
di: Meng, Kaiwen, et al.
Pubblicazione: (2024)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
di: Latafat, Puya, et al.
Pubblicazione: (2023)

Adaptive proximal gradient methods are universal without approximation
di: Oikonomidis, Konstantinos A., et al.
Pubblicazione: (2024)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
di: Latafat, Puya, et al.
Pubblicazione: (2023)

Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices
di: Ou, Hongjia, et al.
Pubblicazione: (2024)

Augmented Lagrangian methods for fully convex composite optimization
di: De Marchi, Alberto, et al.
Pubblicazione: (2025)