Cover Image

Accessible Complexity Bounds for Restarted PDHG on Linear Programs with a Unique Optimizer

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Xiong, Zikai
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

High-Probability Polynomial-Time Complexity of Restarted PDHG for Linear Programming
by: Xiong, Zikai
Published: (2025)

On the Relation Between LP Sharpness and Limiting Error Ratio and Complexity Implications for Restarted PDHG
by: Xiong, Zikai, et al.
Published: (2023)

Restarted Halpern PDHG for Linear Programming
by: Lu, Haihao, et al.
Published: (2024)

Computational Guarantees for Restarted PDHG for LP based on "Limiting Error Ratios" and LP Sharpness
by: Xiong, Zikai, et al.
Published: (2023)

The Role of Level-Set Geometry on the Performance of PDHG for Conic Linear Optimization
by: Xiong, Zikai, et al.
Published: (2024)

Enhanced PDHG for Linear Programming with Online Preconditioning
by: Lu, Haihao, et al.
Published: (2025)

PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programming
by: Li, Bingheng, et al.
Published: (2024)

Concurrent Crossover for PDHG
by: Rothberg, Edward
Published: (2025)

Backing PDHG into a Corner
by: Rothberg, Edward
Published: (2025)

Function-free Optimization via Comparison Oracles
by: Scheinberg, Katya, et al.
Published: (2026)

Hybridizing PDHG and Interior-Point Methods
by: Rothberg, Edward
Published: (2026)

cuPDLP.jl: A GPU Implementation of Restarted Primal-Dual Hybrid Gradient for Linear Programming in Julia
by: Lu, Haihao, et al.
Published: (2023)

A New Crossover Algorithm for LP Inspired by the Spiral Dynamic of PDHG
by: Liu, Tianhao, et al.
Published: (2024)

An Adaptive Parameter-free and Projection-free Restarting Level Set Method for Constrained Convex Optimization Under the Error Bound Condition
by: Lin, Qihang, et al.
Published: (2020)

A Lyapunov Analysis of Accelerated PDHG Algorithms
by: Zeng, Xueying, et al.
Published: (2024)

Monitoring the Convergence Speed of PDHG to Find Better Primal and Dual Step Sizes
by: Fercoq, Olivier
Published: (2024)

Restarted Primal-Dual Hybrid Conjugate Gradient Method for Large-Scale Quadratic Programming
by: Huang, Yicheng, et al.
Published: (2024)

Complexity of Error Bounds for Systems of Linear Inequalities
by: Wei, Zhou, et al.
Published: (2025)

Restart-Free (Accelerated) Gradient Sliding Methods for Strongly Convex Composite Optimization
by: Wu, Xinming, et al.
Published: (2026)

Understanding the PDHG Algorithm via High-Resolution Differential Equations
by: Li, Bowen, et al.
Published: (2024)

A Practical GPU-Enhanced Matrix-Free Primal-Dual Method for Large-Scale Conic Programs
by: Lin, Zhenwei, et al.
Published: (2025)

Decentralized Concurrent Learning with Coordinated Momentum and Restart
by: Ochoa, Daniel E., et al.
Published: (2024)

Optimal Restart Strategies for Parameter-dependent Optimization Algorithms
by: Schönenberger, Lisa, et al.
Published: (2025)

Adaptive Acceleration Without Strong Convexity Priors Or Restarts
by: Cavalcanti, Joao V., et al.
Published: (2025)

Using Taylor-Approximated Gradients to Improve the Frank-Wolfe Method for Empirical Risk Minimization
by: Xiong, Zikai, et al.
Published: (2022)

Complexity of Bilevel Linear Programming with a Single Upper-Level Variable
by: Sugishita, Nagisa, et al.
Published: (2025)

A Technical Note on the Implementation and Use of PDCS
by: Lin, Zhenwei, et al.
Published: (2026)

Restarted contractive operators to learn at equilibrium
by: Davy, Leo, et al.
Published: (2025)

Optimizing Weak Orders via Integer Linear Programming
by: Aledo, Juan A., et al.
Published: (2025)

Economic Linear Quadratic MPC With Non-Unique Optimal Solutions
by: Zanon, Mario
Published: (2025)

Robust Accelerated Dynamics for Subnetwork Bilinear Zero-Sum Games with Distributed Restarting
by: Li, Weijian, et al.
Published: (2025)

Full-Low Evaluation Methods For Bound and Linearly Constrained Derivative-Free Optimization
by: Royer, Clément W., et al.
Published: (2023)

Existence and Uniqueness of Solution for Linear Complementarity Problem in Contact Mechanics
by: Xu, Jiamin, et al.
Published: (2025)

Complexity Bounds for Smooth Multiobjective Optimization
by: Sampaio, Phillipe R.
Published: (2025)

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
by: Grimmer, Benjamin, et al.
Published: (2026)

A Parameter-Free Restart Scheme with Only a Parallelizable $\log\log(1/ε)$ Overhead
by: Wu, Yue, et al.
Published: (2026)

Greedy Restart Schedules: A Baseline for Dynamic Algorithm Selection on Numerical Black-box Optimization Problems
by: Schäpermeier, Lennart
Published: (2025)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
by: Scavuzzo, Lara, et al.
Published: (2024)

Random-Restart Best-Response Dynamics for Large-Scale Integer Programming Games and Their Applications
by: Lee, Hyunwoo, et al.
Published: (2024)

A Sequential Quadratic Programming Method with High Probability Complexity Bounds for Nonlinear Equality Constrained Stochastic Optimization
by: Berahas, Albert S., et al.
Published: (2023)