Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem

B. Jansen, C. Roos and T. Terlaky

Statistica Neerlandica, 1996, vol. 50, issue 1, 146-170

Abstract: The introduction of Karmarkar's polynomial algorithm for linear programming (LP) in 1984 has influenced wide areas in the field of optimization. While in the 1980s emphasis was on developing and implementing efficient variants of interior point methods for LP, the 1990s have shown applicability to certain structured nonlinear programming and combinatorial problems. We will give a historical account of the developments and illustrate the typical results by analyzing a new method for computing the smallest eigenvalue of a matrix. We formulate this latter problem as a so‐called semidefinite optimization problem. Semidefinite optimization has recently gained much attention since it has a lot of applications in various fields (like control and system theory, combinatorial optimization, algebra, statistics, structural design) and semidefinite problems can be efficiently solved with interior point methods.

Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1111/j.1467-9574.1996.tb01485.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:stanee:v:50:y:1996:i:1:p:146-170

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().