Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem

DOI10.1111/j.1467-9574.1996.tb01485.xzbMath0858.90095OpenAlexW2005174711MaRDI QIDQ4715798

Cornelis Roos, Tamás Terlaky, Benjamin Jansen

Publication date: 1996

Published in: Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1467-9574.1996.tb01485.x

zbMATH Keywords

historical surveysemidefinite optimizationinterior point methodsKarmarkar's polynomial algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

Global infimum of strictly convex quadratic functions with bounded perturbations, Sensitivity analysis in linear programming: Just be careful!

Uses Software

• LOQO
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• On computing the determinant in small parallel time using a small number of processors
• Feasibility issues in a primal-dual interior-point method for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Cutting planes and column generation techniques with the projective algorithm
• A polynomial method of approximate centers for linear programming
• An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• Polynomiality of infeasible-interior-point algorithms for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
• Computational experience with penalty-barrier methods for nonlinear programming
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• On the Convergence of the Mizuno--Todd--Ye Algorithm to the Analytic Center of the Solution Set
• The Cutting-Plane Method for Solving Convex Programs
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• Approximate graph coloring by semidefinite programming
• Cones of Matrices and Set-Functions and 0–1 Optimization
• On the Implementation of a Primal-Dual Interior Point Method
• A path following algorithm for a class of convex programming problems
• Path-Following Methods for Linear Programming
• Algorithms for Minimum Trace Factor Analysis
• Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Linear Matrix Inequalities in System and Control Theory
• LOQO:an interior point code for quadratic programming
• On Long Step Path Following and SUMT for Linear and Quadratic Programming
• Semidefinite Programming
• A New Method for Optimal Truss Topology Design