A new linesearch method for quadratically constrained convex programming

Authors:
A. Melman
Affiliations:
Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa 32000, Israel
Venue:
Operations Research Letters
Year:
1994

Citing 4
Cited 0

A new polynomial-time algorithm for linear programming

Combinatorica
On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method

Mathematical Programming: Series A and B
A polynomial-time algorithm, based on Newton's method, for linear programming

Mathematical Programming: Series A and B
Modified barrier functions (theory and methods)

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new method is proposed for the linesearch procedure in logarithmic barrier function and other interior point methods for convex quadratically constrained quadratic programming problems, which includes linear and quadratic programming as special cases. The method consists in transforming the derivative of the function obtained in this linesearch, so that Newton's method for finding its unique root will be globally convergent. It is equally useful in solving a problem in a matrix theory, namely the computation of the eigenvalues of a matrix, perturbed by the addition of a matrix of rank one. An improved Newton method is also presented together with numerical results.