Imagen de Portada

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Kaihuang, Sun, Defeng, Yuan, Yancheng, Zhang, Guojun, Zhao, Xinyuan
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control 90C05, 90C06, 90C25
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
por: Chen, Kaihuang, et al.
Publicado: (2025)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
por: Chen, Kaihuang, et al.
Publicado: (2025)

HPR-LP: An implementation of an HPR method for solving linear programming
por: Chen, Kaihuang, et al.
Publicado: (2024)

Accelerating preconditioned ADMM via degenerate proximal point mappings
por: Sun, Defeng, et al.
Publicado: (2024)

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

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

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

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

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
por: Wang, Haoning, et al.
Publicado: (2025)

A squared smoothing Newton method for semidefinite programming
por: Liang, Ling, et al.
Publicado: (2023)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
por: van Treek, Kira, et al.
Publicado: (2025)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
por: Lin, Zhenwei, et al.
Publicado: (2022)

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

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

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

Variance-Reduced Fast Operator Splitting Methods for Generalized Equations
por: Tran-Dinh, Quoc
Publicado: (2025)

Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates
por: Tran-Dinh, Quoc, et al.
Publicado: (2024)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
por: Giang-Tran, Khanh-Hung, et al.
Publicado: (2025)

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

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

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

Distributed Computing for Huge-Scale Aggregative Convex Programming
por: Tao, Luoyi
Publicado: (2026)

Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
por: Tran-Dinh, Quoc, et al.
Publicado: (2025)

NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems
por: Liang, Ling, et al.
Publicado: (2024)

Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems
por: Tran-Dinh, Quoc
Publicado: (2024)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
por: Zhou, Yingxin, et al.
Publicado: (2025)

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

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

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
por: Arima, Naohiko, et al.
Publicado: (2023)

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

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
por: Themelis, Andreas, et al.
Publicado: (2020)

Nesterov's Accelerated Jacobi-Type Methods for Large-scale Symmetric Positive Semidefinite Linear Systems
por: Liang, Ling, et al.
Publicado: (2024)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
por: Dörfler, Daniel, et al.
Publicado: (2020)

Splitting Algorithms for Distributionally Robust Optimization
por: Briceño-Arias, Luis, et al.
Publicado: (2024)

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

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

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

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

A Highly Efficient Adaptive-Sieving-Based Algorithm for the High-Dimensional Rank Lasso Problem
por: Bai, Xiaoning, et al.
Publicado: (2022)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
por: Nguyen, Vinh
Publicado: (2025)