Keyword: interior point methods

Found 237 papers in total
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
1996,
This paper presents an algorithm for solving a linear program LP (to a given...
An infeasible-interior-point algorithm using projections onto a convex set
An infeasible-interior-point algorithm using projections onto a convex set
1996,
The authors present a new class of primal-dual infeasible-interior-point methods for...
A Mehrotra-type predictor-corrector algorithm with polynomiality and Q-subquadratic convergence
A Mehrotra-type predictor-corrector algorithm with polynomiality and Q-subquadratic convergence
1996,
Mehrotra’s predictor-corrector algorithm is currently considered to be one of...
The design and application of IPMLO: A FORTRAN library for linear optimization with interior point methods
The design and application of IPMLO: A FORTRAN library for linear optimization with interior point methods
1994,
The design principles of the IPMLO, a modularly structured library of FORTRAN...
The trust region affine interior point algorithm for convex and nonconvex quadratic programming
The trust region affine interior point algorithm for convex and nonconvex quadratic programming
1995,
The authors study from a theoretical and numerical point of view an interior point...
On the choice of parameters for power-series interior point algorithms in linear programming
On the choice of parameters for power-series interior point algorithms in linear programming
1995,
In this paper the authors study higher-order interior point algorithms, especially...
On the convergence of the interation sequence in primal-dual interior-point methods
On the convergence of the interation sequence in primal-dual interior-point methods
1995,
Recently, numerous research efforts, most of them concerned with superlinear...
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
1995,
Recently a number of papers were written that present low-complexity interior-point...
Condition numbers for polyhedra with real number data
Condition numbers for polyhedra with real number data
1995,
The authors consider the complexity of finding a feasible point inside a polyhedron...
A survey of the implications of the behavior of the central path for the duality theory of Linear Programming
A survey of the implications of the behavior of the central path for the duality theory of Linear Programming
1995,
The literature in the field of interior point methods for Linear Programming has been...
New infeasible interior-point algorithm based on monomial method
New infeasible interior-point algorithm based on monomial method
1996,
The authors propose a new infeasible path-following algorithm for the convex...
A method of Euclidean centers
A method of Euclidean centers
1996,
In this paper the authors describe a new algorithm for solving a linear programming...
Global convergence in infeasible-interior-point algorithms
Global convergence in infeasible-interior-point algorithms
1994,
This paper presents a wide class of globally convergent interior-point algorithms for...
A globally convergent primal-dual interior point algorithm for convex programming
A globally convergent primal-dual interior point algorithm for convex programming
1994,
This paper studies the global convergence of a large class of primal-dual interior...
Interior-point algorithms for semi-infinite programming
Interior-point algorithms for semi-infinite programming
1994,
In order to study the behavior of interior-point methods on very large-scale linear...
Superlinear convergence of infeasible-interior-point methods for linear programming
Superlinear convergence of infeasible-interior-point methods for linear programming
1994,
At present the interior-point methods of choice are primal-dual...
Polynomiality of infeasible-interior-point algorithms for linear programming
Polynomiality of infeasible-interior-point algorithms for linear programming
1994,
Kojima, Megiddo, and Mizuno investigate an infeasible-interior-point algorithm for...
A predictor-corrector infeasible-interior-point algorithm for linear programming
A predictor-corrector infeasible-interior-point algorithm for linear programming
1994,
The paper presents a predictor-corrector algorithm for solving a primal-dual pair of...
Solving symmetric indefinite systems in an interior-point method for linear programming
Solving symmetric indefinite systems in an interior-point method for linear programming
1993,
The authors describe an implementation of a primal-dual path following method for...
Finding an interior point in the optimal face of linear programs
Finding an interior point in the optimal face of linear programs
1993,
The authors study the problem of finding a point in the relative interior of the...
Scaling, shifting and weighting in interior-point methods
Scaling, shifting and weighting in interior-point methods
1994,
The paper examines certain questions related to the choice of scaling, shifting and...
Recovering an optimal LP basis from an interior point solution
Recovering an optimal LP basis from an interior point solution
1994,
An important issue in the implementation of interior point algorithms for linear...
The ellipsoid method
The ellipsoid method
1993,
The ellipsoid method can be used to find a solution of a system of linear inequalities...
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
1993,
The authors extend Clarkson's randomized algorithm for linear programming to a general...
Papers per page: