Keyword: interior point methods

Found 237 papers in total
On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs
On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs
1997,
This note derives bounds on the length of the primal–dual affine scaling...
The Projective Method for solving linear matrix inequalities
The Projective Method for solving linear matrix inequalities
1997,
Numerous problems in control and systems theory can be formulated in terms of linear...
The long-step method of analytic centers for fractional problems
The long-step method of analytic centers for fractional problems
1997,
We develop a long-step surface-following version of the method of analytic centers for...
Interior dual proximal point algorithm for linear programs
Interior dual proximal point algorithm for linear programs
1994,
A new algorithm for solving a linear program based on an interior point method applied...
Combining interior-point and pivoting algorithms for linear programming
Combining interior-point and pivoting algorithms for linear programming
1996,
We propose a new approach to combine linear programming (LP) interior-point and...
A primal–dual interior point method whose running time depends only on the constraint matrix
A primal–dual interior point method whose running time depends only on the constraint matrix
1996,
We propose a primal–dual ‘layered-step’ interior point (LIP)...
Superlinear convergence of the affine scaling algorithm
Superlinear convergence of the affine scaling algorithm
1996,
In this paper we show that a variant of the long-step affine scaling algorithm (with...
Predictor–corrector algorithm for solving the P*(κ)-matrix linear complementarity problem from arbitrary positive starting points
Predictor–corrector algorithm for solving the P*(κ)-matrix linear complementarity problem from arbitrary positive starting points
1997,
A new predictor–corrector algorithm is proposed for solving P *...
The largest step path following algorithm for monotone linear complementarity problems
The largest step path following algorithm for monotone linear complementarity problems
1997,
Path-following algorithms take at each iteration a Newton step for approaching a point...
An interior point potential reduction method for constrained equations
An interior point potential reduction method for constrained equations
1996,
We study the problem of solving a constrained system of nonlinear equations by a...
Superlinear and quadratic convergence of some primal–dual interior point methods for constrained optimization
Superlinear and quadratic convergence of some primal–dual interior point methods for constrained optimization
1996,
This paper proves local convergence rates of primal–dual interior point methods...
Speeding up Karmarkar’s algorithm for multicommodity flows
Speeding up Karmarkar’s algorithm for multicommodity flows
1996,
The authors show how to speed up Karmarkar’s linear programming algorithm for...
Extension of Karmarkar’s algorithm onto convex quadratically constrained quadratic problems
Extension of Karmarkar’s algorithm onto convex quadratically constrained quadratic problems
1996,
Convex quadratically constrained quadratic problems are considered. It is shown that...
A relaxed primal-dual path-following algorithm for linear programming
A relaxed primal-dual path-following algorithm for linear programming
1996,
In this paper the authors provide an easily satisfied relaxation condition for the...
Primal-dual target-following algorithms for linear programming
Primal-dual target-following algorithms for linear programming
1996,
In this paper, the authors propose a method for linear programming with the property...
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
1996,
Recently, Todd has analyzed in detail the primal-dual affine-scaling method for linear...
A simple proof of a primal affine scaling method
A simple proof of a primal affine scaling method
1996,
This paper presents a simpler proof of the result of Tsuchiya and Muramatsu on the...
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
1996,
In this paper, the authors propose an infeasible-interior-point algorithm for linear...
The primal power affine scaling method
The primal power affine scaling method
1996,
This paper presents a variant of the primal affine scaling method, which it calls the...
An O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence
An O(nL) infeasible-interior-point algorithm for LCP with quadratic convergence
1996,
The Mizuno-Todd-Ye predictor-corrector algorithm for linear programming is extended...
Large step volumetric potential reduction algorithms for linear programming
Large step volumetric potential reduction algorithms for linear programming
1996,
The paper considers the construction of potential reduction algorithms using...
An interior point method for general large-scale quadratic programming problems
An interior point method for general large-scale quadratic programming problems
1996,
In this paper, the authors present an interior point algorithm for solving both convex...
A convergence analysis for a convex version of Dikin’s algorithm
A convergence analysis for a convex version of Dikin’s algorithm
1996,
This paper is concerned with the convergence property of Dikin’s algorithm...
Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
1996,
The primal-dual infeasible-interior-point algorithm is knwon as one of the most...
Papers per page: