A DRS-based path-following algorithm for linear programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A multiscale semi-smooth Newton method for optimal transport
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- An ADMM-based interior-point method for large-scale linear programming
- An augmented incomplete factorization approach for computing the Schur complement in stochastic optimization
- Benchmarking optimization software with performance profiles.
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Emergence of Scaling in Random Networks
- Interior point methods of mathematical programming
- Linear programming. Foundations and extensions
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Numerical Optimization
- On free variables in interior point methods
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On well definedness of the central path
- Parallelizing the dual revised simplex method
- Subgradient methods for huge-scale optimization problems
This page was built for publication: A DRS-based path-following algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232372)
