On the relationships among GPU-accelerated first-order methods for solving linear programming

DOI10.4208/JCM.2606-M2025-0260MaRDI QIDQ7412197zbMATH OpenFDO

Authors Kaihuang Chen, Defeng Sun, Yancheng Yuan, Guojun Zhang, Xinyuan Zhao

Publication date 2027

Published in Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/JCM.2606-M2025-0260

zbMATH Keywords

GPU accelerationHalpern Peaceman-Rachfordlinear programmingproximal alternating direction method of multipliers

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Convex programming (90C25)

Cites work

• A class of linearized proximal alternating direction methods
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A first order method for solving convex bilevel optimization problems
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
• A practical and optimal first-order method for large-scale convex quadratic programming
• Accelerating preconditioned ADMM via degenerate proximal point mappings
• An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems
• An ADMM-based interior-point method for large-scale linear programming
• An enhanced alternating direction method of multipliers-based interior point method for linear and conic optimization
• Approximation of fixed points of nonexpansive mappings
• Conic optimization via operator splitting and homogeneous self-dual embedding
• Convergence rate analysis of several splitting schemes
• Convex Analysis
• Degenerate Preconditioned Proximal Point Algorithms
• Faster first-order primal-dual methods for linear programming using restarts and sharpness
• Fixed points of nonexpanding maps
• HPR-LP: an implementation of an HPR method for solving linear programming
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3574917 (Why is no real title available?)
• Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
• Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions
• On the convergence rate of the Halpern-iteration
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• On the ergodic convergence rates of a first-order primal-dual algorithm
• Operator splitting for a homogeneous embedding of the linear complementarity problem
• OSQP: an operator splitting solver for quadratic programs
• Quantitative results for Halpern iterations of nonexpansive mappings
• Splitting Algorithms for the Sum of Two Nonlinear Operators

This page was built for publication: On the relationships among GPU-accelerated first-order methods for solving linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7412197)