Interior proximal point algorithm for linear programs
From MaRDI portal
Recommendations
- Interior dual proximal point algorithm for linear programs
- Implementing proximal point methods for linear programming
- An interior point method for linear programming
- Interior dual proximal point algorithm using preconditioned conjugate gradient †
- On the finite convergence of interior-point algorithms for linear programming
Cites work
- A new polynomial-time algorithm for linear programming
- A variable-metric variant of the Karmarkar algorithm for linear programming
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- Monotone Operators and the Proximal Point Algorithm
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Yale sparse matrix package I: The symmetric codes
Cited in
(18)- scientific article; zbMATH DE number 5563572 (Why is no real title available?)
- Implementing proximal point methods for linear programming
- Existence, uniqueness, and convergence of the regularized primal-dual central path
- An interior-point algorithm for solving inverse linear optimization problem
- Proximal-point algorithm using a linear proximal term
- Interior Dual Least 2-Norm Algorithm for Linear Programs
- PCx: an interior-point code for linear programming
- Quadratic regularizations in an interior-point method for primal block-angular problems
- A primal-dual regularized interior-point method for convex quadratic programs
- Proximal minimizations with D-functions and the massively parallel solution of linear network programs
- Interior dual proximal point algorithm using preconditioned conjugate gradient †
- The adventures of a simple algorithm
- Interior dual proximal point algorithm for linear programs
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- An Interior-Point Algorithm for Linearly Constrained Optimization
- A Low Complexity Interior-Point Algorithm for Linear Programming
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
This page was built for publication: Interior proximal point algorithm for linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321229)
