Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
From MaRDI portal
Publication:6188510
DOI10.1137/22m1510467arXiv2102.04592OpenAlexW3128682647WikidataQ129028895 ScholiaQ129028895MaRDI QIDQ6188510
No author found.
Publication date: 7 February 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.04592
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- OSQP: An Operator Splitting Solver for Quadratic Programs
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Subgradient methods for huge-scale optimization problems
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- Optimality, identifiability, and sensitivity
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Convex analysis and nonlinear optimization. Theory and examples.
- Finite termination of the proximal point algorithm
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Accelerated first-order methods for hyperbolic programming
- On finite convergence and constraint identification of subgradient projection methods
- On the convergence of projected gradient processes to singular critical points
- Computational techniques of the simplex method
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Infeasibility detection in the alternating direction method of multipliers for convex optimization
- On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
- Convergence rates of forward-Douglas-Rachford splitting method
- Local convergence properties of Douglas-Rachford and alternating direction method of multipliers
- Conflict analysis in mixed integer programming
- Asymptotic behavior of contractions in Hilbert space
- A \(\mathcal{VU}\)-algorithm for convex minimization
- On the minimal displacement vector of the Douglas-Rachford operator
- The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces
- Identifiable Surfaces in Constrained Optimization
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the Identification of Active Constraints II: The Nonconvex Case
- Projected gradient methods for linearly constrained problems
- On the Identification of Active Constraints
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Algorithms for nonlinear constraints that use lagrangian functions
- Exposing Constraints
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
- Active Sets, Nonsmoothness, and Sensitivity
- Computer Codes for the Analysis of Infeasible Linear Programs
- Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem
- On the Convergence of Primal-Dual Hybrid Gradient Algorithm
- Convergence Rate Analysis of Several Splitting Schemes
- Convex Analysis
- An introduction to continuous optimization for imaging
- Local linear convergence analysis of Primal–Dual splitting methods
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
