Cover Image

HPR-LP: An implementation of an HPR method for solving linear programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Kaihuang, Sun, Defeng, Yuan, Yancheng, Zhang, Guojun, Zhao, Xinyuan
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C05, 90C06, 90C25, 65Y20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

The SCIP Optimization Suite 9.0
by: Bolusani, Suresh, et al.
Published: (2024)

The SCIP Optimization Suite 10.0
by: Hojny, Christopher, et al.
Published: (2025)

A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
by: Wang, Jia, et al.
Published: (2025)

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

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

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

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

Mixed-integer linearity in nonlinear optimization: a trust region approach
by: De Marchi, Alberto
Published: (2023)

Efficient globalization of heavy-ball type methods for unconstrained optimization based on curve searches
by: Donnini, Federica, et al.
Published: (2025)

Symplectic Discretization Approach for Developing New Proximal Point Algorithm
by: Yuan, Ya-xiang, et al.
Published: (2023)

Hybrid optimal control with mixed-integer Lagrangian methods
by: Nikitina, Viktoriya, et al.
Published: (2024)

Randomized block proximal method with locally Lipschitz continuous gradient
by: Pérez-Aros, Pedro, et al.
Published: (2025)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
by: De Marchi, Alberto
Published: (2024)

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

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
by: Zeng, Hanfeng, et al.
Published: (2026)

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

Randomized subspace correction methods for convex optimization
by: Jiang, Boou, et al.
Published: (2025)