A globally convergent primal—dual interior point algorithm for convex programming

Saved in:
Bibliographic Details
Published inMathematical programming Vol. 64; no. 1-3; pp. 123 - 147
Main Author Monteiro, Renato D. C.
Format Journal Article
LanguageEnglish
Published Heidelberg Springer 01.03.1994
Subjects
Applied sciences
Exact sciences and technology
Mathematical programming
Operational research and scientific management
Operational research. Management science
Reduction method
Primal dual method
Interior point method
Potential function
Karmarkar algorithm
Convex programming
Convergence
Mathematical programming
Online AccessGet full text
ISSN0025-5610
1436-4646
DOI10.1007/BF01582568

Cover

More Information
ISSN:0025-5610
1436-4646
DOI:10.1007/BF01582568