Computational experience with a primal-dual interior-point method for smooth convex programming

1 January 1994

journal article
research article
Published by Taylor & Francis in Optimization Methods and Software

Vol. 3 (4) , 285-310
https://doi.org/10.1080/10556789408805571

Abstract

This paper presents some computational experience with a primal-dual interior-point method for smooth convex programming. The algorithm is a direct extension of a primal-dual interior-point method for linear programming. In particular, it does not involve any line search, a definite advantage when function evaluations are costly. The test problems are geometric programming problems and randomly generated convex quadratically constrained problems. We study the influence of the size of the problem (number of inequality constraints and numbers of free variables) on the total number of iterations.

Keywords

This publication has 22 references indexed in Scilit:

On the method of analytic centers for solving smooth convex programs
Published by Springer Nature ,2006
Centered newton method for mathematical programming
Published by Springer Nature ,2006
A globally convergent primal-dual interior point method for constrained optimization
Optimization Methods and Software, 1998
An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
SIAM Journal on Optimization, 1996
A logarithmic barrier cutting plane method for convex programming
Annals of Operations Research, 1995
On the Implementation of a Primal-Dual Interior Point Method
SIAM Journal on Optimization, 1992
A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
Optimization, 1992
Computational experience with a primal-dual interior point method for linear programming
Linear Algebra and its Applications, 1991
An interior point algorithm for solving smooth convex programs based on Newton’s method
Published by American Mathematical Society (AMS) ,1990
A polynomial newton method for linear programming
Algorithmica, 1986