Copertina

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chen, Kaihuang, Sun, Defeng, Yuan, Yancheng, Zhang, Guojun, Zhao, Xinyuan
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control 90C05, 90C06, 90C25, 65Y20
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
di: Kempke, Nils-Christian, et al.
Pubblicazione: (2024)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
di: Bao, Chenglong, 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)

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

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

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
di: Zhou, Yingxin, 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)

Parallel block coordinate descent methods with identification strategies
di: Lopes, Ronaldo, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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 SCIP Optimization Suite 9.0
di: Bolusani, Suresh, et al.
Pubblicazione: (2024)

The SCIP Optimization Suite 10.0
di: Hojny, Christopher, et al.
Pubblicazione: (2025)

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)

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

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

Monomial barrier functions for the box-constrained convex optimization problems
di: Fayed, Hatem
Pubblicazione: (2024)

Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
di: Berahas, Albert S., et al.
Pubblicazione: (2025)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
di: Aguirre, Jacob M., et al.
Pubblicazione: (2025)

Variational Properties of Decomposable Functions. Part II: Strong Second-Order Theory
di: Ouyang, Wenqing, et al.
Pubblicazione: (2023)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
di: Ou, Hongjia, et al.
Pubblicazione: (2025)

A non-monotone trust-region method with noisy oracles and additional sampling
di: Krejic, Natasa, et al.
Pubblicazione: (2023)

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

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

An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
di: Chen, Liang, et al.
Pubblicazione: (2025)

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

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

Active set identification and rapid convergence for degenerate primal-dual problems
di: Díaz, Mateo, et al.
Pubblicazione: (2026)

$Q$-fully Quadratic Modeling and its Application in a Random Subspace Derivative-free Method
di: Chen, Yiwen, et al.
Pubblicazione: (2023)