Keyword: interior point methods

Found 237 papers in total
Polynomiality of primal–dual affine scaling algorithms for nonlinear complementarity problems
Polynomiality of primal–dual affine scaling algorithms for nonlinear complementarity problems
1997,
This paper provides an analysis of the polynomiality of primal–dual interior...
A note on the existence of the Alizadeh–Haeberly–Overton direction for semidefinite programming
A note on the existence of the Alizadeh–Haeberly–Overton direction for semidefinite programming
1997,
This note establishes a new sufficient condition for the existence and uniqueness of...
Exploiting sparsity in primal–dual interior-point methods for semidefinite programming
Exploiting sparsity in primal–dual interior-point methods for semidefinite programming
1997,
The...
Interior-point methods: An old and new approach to nonlinear programming
Interior-point methods: An old and new approach to nonlinear programming
1997,
In this paper we discuss the main concepts of structural optimization, a field of...
A nonconvex weighted potential function for polynomial target following methods
A nonconvex weighted potential function for polynomial target following methods
1998,
Long step interior-point methods in linear programming are some of the most efficient...
A path following method for LCP with superlinearly convergent iteration sequence
A path following method for LCP with superlinearly convergent iteration sequence
1998,
A new algorithm for solving linear complementarity problems with sufficient matrices...
Interior Point Methods of Mathematical Programming
Interior Point Methods of Mathematical Programming
1997,
Free material optimization via mathematical programming
Free material optimization via mathematical programming
1997,
This paper deals with a central question of structural optimization which is...
Sparse matrix ordering methods for interior point linear programming
Sparse matrix ordering methods for interior point linear programming
1998,
The main cost of solving a linear programming problem using an interior point method...
Presolve analysis of linear programs prior to applying an interior point method
Presolve analysis of linear programs prior to applying an interior point method
1997,
Several issues concerning an analysis of large and sparse linear programming problems...
A path-following version of the Todd–Burrell procedure for linear progamming
A path-following version of the Todd–Burrell procedure for linear progamming
1997,
We propose a path-following version of the Todd–Burrell procedure to solve...
Initialization in semidefinite programming via a self-dual skew-symmetric embedding
Initialization in semidefinite programming via a self-dual skew-symmetric embedding
1997,
The formulation of interior point algorithms for semidefinite programming has become...
Interior point methods for linear programming: Computational state of the art
Interior point methods for linear programming: Computational state of the art
1994,
A survey of the significant developments in the field of interior point methods for...
Numerical factorization methods for interior point algorithms
Numerical factorization methods for interior point algorithms
1994,
Interior point algorithms for linear programming acheive significant reductions in...
Using aspiration levels in an interactive interior multiobjective linear programming algorithm
Using aspiration levels in an interactive interior multiobjective linear programming algorithm
1996,
In this paper, we propose the use of an interior-point linear programming algorithm...
A homotopy interior algorithm for posynomial geometric programming
A homotopy interior algorithm for posynomial geometric programming
1996,
In this paper, the authors establish a Newton-type homotopy interior-point algorithm...
A simplex-interior algorithm for solving linear programming
A simplex-interior algorithm for solving linear programming
1996,
Starting with 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...
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...
Direct ellipsoid method for convex quadratic program
Direct ellipsoid method for convex quadratic program
1996,
This paper shows how to apply the ellipsoid method directly to the convex quadratic...
On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
1997,
We are motivated by the problem of constructing a primal–dual barrier function...
Inverse barriers and CES-functions in linear programming
Inverse barriers and CES-functions in linear programming
1997,
Recently, much attention was paid to polynomial interior point methods, almost...
On the convergence rate of Newton interior-point methods in the absence of strict complementarity
On the convergence rate of Newton interior-point methods in the absence of strict complementarity
1996,
In the absence of strict complementarity, Monteiro and Wright proved that the...
A scalable parallel interior point algorithm for stochastic linear programming and robust optimization
A scalable parallel interior point algorithm for stochastic linear programming and robust optimization
1997,
We present a computationally efficient implementation of an interior point algorithm...
Papers per page: