Image de couverture de livre

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhou, Yingxin, Cipolla, Stefano, Vuong, Phan Tu
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control Numerical Analysis 65K05, 90C05, 90C06, 90C25, 90C33
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
par: Bao, Chenglong, et autres
Publié: (2024)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
par: Bao, Chenglong, et autres
Publié: (2023)

HPR-LP: An implementation of an HPR method for solving linear programming
par: Chen, Kaihuang, et autres
Publié: (2024)

A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
par: Wang, Jia, et autres
Publié: (2025)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
par: Traoré, Cheik, et autres
Publié: (2025)

On the convergence of proximal gradient methods for convex simple bilevel optimization
par: Latafat, Puya, et autres
Publié: (2023)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
par: Bollapragada, Raghu, et autres
Publié: (2025)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
par: Takahashi, Shota, et autres
Publié: (2025)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
par: Song, Yongcun, et autres
Publié: (2024)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
par: Wang, Haoning, et autres
Publié: (2025)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
par: He, Jiahuan, et autres
Publié: (2023)

Monomial barrier functions for the box-constrained convex optimization problems
par: Fayed, Hatem
Publié: (2024)

Hybrid optimal control with mixed-integer Lagrangian methods
par: Nikitina, Viktoriya, et autres
Publié: (2024)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
par: Chen, Kaihuang, et autres
Publié: (2025)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
par: Latafat, Puya, et autres
Publié: (2023)

Adaptive proximal gradient methods are universal without approximation
par: Oikonomidis, Konstantinos A., et autres
Publié: (2024)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
par: Latafat, Puya, et autres
Publié: (2023)

Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices
par: Ou, Hongjia, et autres
Publié: (2024)

A non-monotone trust-region method with noisy oracles and additional sampling
par: Krejic, Natasa, et autres
Publié: (2023)

On Averaging and Extrapolation for Gradient Descent
par: Luner, Alan, et autres
Publié: (2024)

General Optimal Step-size for ADMM-type Algorithms: Domain Parametrization and Optimal Rates
par: Ran, Yifan
Publié: (2023)

An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
par: Chen, Liang, et autres
Publié: (2025)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
par: Ou, Hongjia, et autres
Publié: (2025)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
par: Chen, Jian, et autres
Publié: (2026)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
par: Zhou, Juan, et autres
Publié: (2024)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
par: Deng, Kangkang, et autres
Publié: (2025)

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
par: Zeng, Hanfeng, et autres
Publié: (2026)

Mixed-integer linearity in nonlinear optimization: a trust region approach
par: De Marchi, Alberto
Publié: (2023)

Variational Properties of Decomposable Functions. Part I: Strict Epi-Calculus and Applications
par: Ouyang, Wenqing, et autres
Publié: (2023)

Randomized block proximal method with locally Lipschitz continuous gradient
par: Pérez-Aros, Pedro, et autres
Publié: (2025)

Variational Properties of Decomposable Functions. Part II: Strong Second-Order Theory
par: Ouyang, Wenqing, et autres
Publié: (2023)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
par: De Marchi, Alberto
Publié: (2024)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
par: Deng, Kangkang, et autres
Publié: (2024)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
par: Niu, Yi-Shuai, et autres
Publié: (2018)

Active set identification and rapid convergence for degenerate primal-dual problems
par: Díaz, Mateo, et autres
Publié: (2026)

Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
par: Berahas, Albert S., et autres
Publié: (2025)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
par: Mannel, Florian
Publié: (2024)

A structured L-BFGS method and its application to inverse problems
par: Mannel, Florian, et autres
Publié: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
par: Mannel, Florian, et autres
Publié: (2024)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
par: Chen, Xiaojun, et autres
Publié: (2022)