DMCA
Interior-point Methods (2000)
Cached
Download Links
- [www.cs.wisc.edu]
- [www.cs.wisc.edu]
- [www.math.umbc.edu]
- [www.math.umbc.edu]
- [info.mcs.anl.gov]
- [www.mcs.anl.gov]
- [info.mcs.anl.gov]
- DBLP
Other Repositories/Bibliography
| Citations: | 604 - 15 self |
BibTeX
@MISC{Potra00interior-pointmethods,
author = {Florian A. Potra and Stephen J. Wright},
title = {Interior-point Methods},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The modern era of interior-point methods dates to 1984, when Karmarkar proposed his algorithm for linear programming. In the years since then, algorithms and software for linear programming have become quite sophisticated, while extensions to more general classes of problems, such as convex quadratic programming, semidefinite programming, and nonconvex and nonlinear problems, have reached varying levels of maturity. We review some of the key developments in the area, including comments on both the complexity theory and practical algorithms for linear programming, semidefinite programming, monotone linear complementarity, and convex programming over sets that can be characterized by self-concordant barrier functions.
Keyphrases
linear programming interior-point method semidefinite programming nonlinear problem key development complexity theory convex programming modern era interior-point method date general class convex quadratic programming practical algorithm self-concordant barrier function monotone linear complementarity varying level
