Boundary Behavior of Interior Point Algorithms in Linear Programming

Recommendations

Publication:5202842
On the asymptotic behavior of the projective rescaling algorithm for linear programming
Asymptotic behaviour of Karmarkar's method for linear programming
Linear programming and the Newton barrier flow
Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming

Cited in

(54)

On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming
The convergent generalized central paths for linearly constrained convex programming
Integrability of vector and multivector fields associated with interior point methods for linear programming
Unified complexity analysis for Newton LP methods
Polynomial affine algorithms for linear programming
Long steps in an \(O(n^ 3L)\) algorithm for linear programming
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
Global convergence of the affine scaling methods for degenerate linear programming problems
Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
A weighted least squares study of robustness in interior point linear programming
Linear programming and the Newton barrier flow
A simplified global convergence proof of the affine scaling algorithm
An Interior Point Method for Bordered Block-Diagonal Linear Programs
A Primal-dual affine scaling algorithm with necessary centering as a safeguard
Feasible region contraction interior point algorithm
Trust region affine scaling algorithms for linearly constrained convex and concave programs
A polynomial-time algorithm, based on Newton's method, for linear programming
Central path curvature and iteration-complexity for redundant Klee-Minty cubes
Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case
Degeneracy in interior point methods for linear programming: A survey
Limiting behavior of weighted central paths in linear programming
Hamiltonian structure of dynamical systems which solve linear programming problems
Affine scaling with degenerate linear programming problems
An implementation of Karmarkar's algorithm for linear programming
The central curve in linear programming
Experimental investigations in combining primal dual interior point method and simplex based LP solvers
Superlinear convergence of the affine scaling algorithm
scientific article; zbMATH DE number 554743 (Why is no real title available?)
An \(O(n^ 3L)\) potential reduction algorithm for linear programming
A primal-dual interior point method whose running time depends only on the constraint matrix
A linear constrained optimization Benchmark for probabilistic search algorithms: the rotated Klee-Minty problem
A boundary-point LP solution method and its application to dense linear programs
On the asymptotic behavior of the projective rescaling algorithm for linear programming
Lax pair and fixed point analysis of Karmarkar's projective scaling trajectory for linear programming
A study of the dual affine scaling continuous trajectories for linear programming
Improving the rate of convergence of interior point methods for linear programming
On some properties and an application of the logarithmic barrier method
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
A Polynomial Method of Weighted Centers for Convex Quadratic Programming
Analysis of some interior point continuous trajectories for convex programming
Solving combinatorial optimization problems using Karmarkar's algorithm
On well definedness of the central path
A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
A survey of search directions in interior point methods for linear programming
On the convergence of the affine-scaling algorithm
On the number of iterations of Karmarkar's algorithm for linear programming
Asymptotic behaviour of Karmarkar's method for linear programming
A unified view of interior point methods for linear programming
The affine-scaling direction for linear programming is a limit of projective-scaling directions
Optimizing over three-dimensional subspaces in an interior-point method for linear programming
Interior-point methods for linear programming: a review
THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
Introduction: New approaches to linear programming
NEWTON FLOW AND INTERIOR POINT METHODS IN LINEAR PROGRAMMING

This page was built for publication: Boundary Behavior of Interior Point Algorithms in Linear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3830814)