Keyword: interior point methods

Found 237 papers in total
New complexity analysis of the primal–dual Newton method for linear optimization
New complexity analysis of the primal–dual Newton method for linear optimization
2000,
We deal with the primal–dual Newton method for linear optimization (LO)....
On two homogeneous self-dual approaches to linear programming and its extensions
On two homogeneous self-dual approaches to linear programming and its extensions
2001,
We investigate the relation between interior-point algorithms applied to two...
On finite termination in the primal–dual method for linear programming
On finite termination in the primal–dual method for linear programming
2001,
In this paper we propose a modification of the finite termination algorithm which...
On the applicability of Karmarkar's algorithm
On the applicability of Karmarkar's algorithm
2000,
This paper presents an attempt undertaken in order to answer the question of the...
Computing approximate solutions for convex conic systems of constraints
Computing approximate solutions for convex conic systems of constraints
2000,
We propose a way to reformulate a conic system of constraints as an optimization...
A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints
A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints
2000,
A trust region and affine scaling interior point method (TRAM) is proposed for a...
Failure of global convergence for a class of interior point methods for nonlinear programming
Failure of global convergence for a class of interior point methods for nonlinear programming
2000,
Using a simple analytical example, we demonstrate that a class of interior point...
A trust region method based on interior point techniques for nonlinear programming
A trust region method based on interior point techniques for nonlinear programming
2000,
An algorithm for minimizing a nonlinear function subject to nonlinear inequality...
On the implementation of an optimal basis identification procedure for interior point method
On the implementation of an optimal basis identification procedure for interior point method
2000,
In this study, we deal with the implementation of an optimal basis identification...
A partial updating algorithm for linear programs with many more variables than constraints
A partial updating algorithm for linear programs with many more variables than constraints
1995,
We present a modified version of Ye's potential reduction algorithm for linear...
An ellipsoid algorithm for equality-constrained nonlinear programs
An ellipsoid algorithm for equality-constrained nonlinear programs
2001,
This paper describes an ellipsoid algorithm that solves convex problems having linear...
LPABO: A program for interior point methods for linear programming
LPABO: A program for interior point methods for linear programming
2000,
LPABO (Linear programming Package with the Affine-scaling and the Barrier method using...
Piecewise linear programming via interior points
Piecewise linear programming via interior points
2000,
The main aim of this work is to provide some basis for the development of interior...
An infeasible-interior-point potential-reduction algorithm for linear programming
An infeasible-interior-point potential-reduction algorithm for linear programming
1999,
This paper studies a new potential-function and an infeasible-interior-point method...
Interior-point methods for nonconvex nonlinear programming: Orderings and higher-order methods
Interior-point methods for nonconvex nonlinear programming: Orderings and higher-order methods
2000,
The paper extends prior work by the authors on LOQO, an interior point algorithm for...
On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
1999,
A simple and unified analysis is provided on the rate of local convergence for a class...
Stabilization of interior-point methods for linear programming
Stabilization of interior-point methods for linear programming
1999,
The paper studies numerical stability problems arising in the application of...
An infeasible-interior-point potential-reduction algorithm for linear programming
An infeasible-interior-point potential-reduction algorithm for linear programming
1999,
This paper studies a new potential-function and an infeasible-interior-point method...
Matrix sensitivity analysis from an interior solution of a linear program
Matrix sensitivity analysis from an interior solution of a linear program
1999,
This article considers the effect of changing matrix coefficients in a linear program...
An interior-point based subgradient method for nondifferentiable convex optimization
An interior-point based subgradient method for nondifferentiable convex optimization
1998,
We propose in this paper an algorithm for solving linearly constrained...
An interior point method in Dantzig–Wolfe decomposition
An interior point method in Dantzig–Wolfe decomposition
1999,
This paper studies the application of interior point methods in Dantzig–Wolfe...
An ϵ–sensitivity analysis in the primal–dual interior point method
An ϵ–sensitivity analysis in the primal–dual interior point method
1999,
This paper presents a method of sensitivity analysis on the cost coefficients and the...
An implementation of preprocessing for interior point methods for linear programming
An implementation of preprocessing for interior point methods for linear programming
1999,
We classified preprocessing methods into (1) analytic methods, (2) methods for...
Primal interior dual-simplex method and dual interior primal-simplex method in the general bounded linear programming
Primal interior dual-simplex method and dual interior primal-simplex method in the general bounded linear programming
1999,
In this paper, Primal-Interior Dual-Simplex method (PIDS) and Dual-Interior...
Papers per page: