HPR-LP: an implementation of an HPR method for solving linear programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A class of linearized proximal alternating direction methods
- 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
- Accelerated proximal point method for maximally monotone operators
- Accelerating preconditioned ADMM via degenerate proximal point mappings
- An ADMM-based interior-point method for large-scale linear programming
- An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems
- An enhanced alternating direction method of multipliers-based interior point method for linear and conic optimization
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Degenerate Preconditioned Proximal Point Algorithms
- Faster first-order primal-dual methods for linear programming using restarts and sharpness
- Fixed points of nonexpanding maps
- Hankel matrix rank minimization with applications to system identification and realization
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- Julia: a fresh approach to numerical computing
- 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
- OSQP: an operator splitting solver for quadratic programs
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- 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 ergodic convergence rates of a first-order primal-dual algorithm
- Operator splitting for a homogeneous embedding of the linear complementarity problem
- Progress in mathematical programming solvers from 2001 to 2020
- QAPLIB - a quadratic assignment problem library
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Subgradient methods for huge-scale optimization problems
This page was built for publication: HPR-LP: an implementation of an HPR method for solving linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229383)
