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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
