Keyword: interior point methods

Found 237 papers in total
A polynomial time interior-point path-following algorithm for the linear complementarity problem based on Chen–Harker–Kanzow smoothing techniques
A polynomial time interior-point path-following algorithm for the linear complementarity problem based on Chen–Harker–Kanzow smoothing techniques
1999,
A polynomial complexity bound is established for an interior-point path-following...
On free variables in interior point methods
On free variables in interior point methods
1998,
Interior point methods, especially the algorithms for linear programming problems, are...
The analyticity of interior-point-paths at strictly complementary solutions of linear programs
The analyticity of interior-point-paths at strictly complementary solutions of linear programs
1998,
This paper investigates the analyticity of certain paths that arise in the context of...
Solving large-scale linear programs by interior-point methods under the MATLAB environment
Solving large-scale linear programs by interior-point methods under the MATLAB environment
1998,
In this paper, we describe our implementation of a primal–dual...
Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems
Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems
1998,
We present primal–dual interior-point algorithms with polynomial iteration...
Interior point methods of mathematical programming
Interior point methods of mathematical programming
1999,
A globally convergent primal–dual interior point method for constrained optimization
A globally convergent primal–dual interior point method for constrained optimization
1998,
This paper proposes a primal–dual interior point method for solving general...
An interior Newton method for quadratic programming
An interior Newton method for quadratic programming
1999,
We propose a new (interior) approach for the general quadratic programming problem. We...
A generalized interior-point barrier function approach for smooth convex programming with linear constraints
A generalized interior-point barrier function approach for smooth convex programming with linear constraints
1999,
Interior point methods were originally designed to obtain the polynomial-time...
Interior-point methods with decomposition for solving large-scale linear programs
Interior-point methods with decomposition for solving large-scale linear programs
1999,
This paper deals with an algorithm incorporating the interior-point method into the...
On the primal–dual method of interior point programming
On the primal–dual method of interior point programming
1998,
In this work, we deal with the formulation of the primal–dual interior-point...
Predictor–corrector method for nonlinear complementarity problem
Predictor–corrector method for nonlinear complementarity problem
1997,
Ye et al . proved that the predictor–corrector method proposed by Mizuno et al ....
On exploiting problem structure in a basis identification procedure for linear programming
On exploiting problem structure in a basis identification procedure for linear programming
1999,
During the last decade, interior-point methods have become an efficient alternative to...
A simplex–interior algorithm for solving linear programming
A simplex–interior algorithm for solving linear programming
1996,
According to the simplex method and long step path following algorithm, the author...
An optimal basis identification criterion for interior-point linear programming algorithms
An optimal basis identification criterion for interior-point linear programming algorithms
1996,
In this paper, the properties of an indicator vector for identifying an optimal basis...
Condition measures and properties of the central trajectory of a linear program
Condition measures and properties of the central trajectory of a linear program
1998,
Given a data instance d = (A,b,c) of a linear program, we show that certain properties...
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation
1999,
In this paper, we propose an infeasible-interior-point algorithm for solving a...
Infeasible-start primal–dual methods and infeasibility detectors for nonlinear programming problems
Infeasible-start primal–dual methods and infeasibility detectors for nonlinear programming problems
1999,
In this paper we present several ‘infeasible-start’ path-following and...
Interior ellipsoid method for convex quadratic programming
Interior ellipsoid method for convex quadratic programming
1996,
In this paper, a new variant of the interior ellipsoid method for convex quadratic...
On quadratic convergence of the O(√(n)L)-iteration homogeneous and self-dual linear programming algorithm
On quadratic convergence of the O(√(n)L)-iteration homogeneous and self-dual linear programming algorithm
1999,
In this paper, we show that Ye–Todd–Mizuno's O(√(n)L) -iteration...
Application of interior-point methods to model predictive control
Application of interior-point methods to model predictive control
1998,
We present a structured interior-point method for the efficient solution of the...
An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
1998,
We present an algorithm for the variational inequality problem on convex sets with...
The role of the augmented system in interior point methods
The role of the augmented system in interior point methods
1998,
We present a way to use the augmented system approach in interior point methods. We...
Spectral methods for graph bisection problems
Spectral methods for graph bisection problems
1998,
In this paper, we study the spectral methods for graph bisection problems and conclude...
Papers per page: