Primal-dual interior-point methods

Primal-dual interior-point methods (1997)

by Florian A. Potra , Stephen J. Wright

Citations:

Datum	Value	Source
TITLE	Primal-dual interior-point methods	INFERENCE
AUTHOR NAME	Florian A. Potra	SVM HeaderParse 0.2
AUTHOR NAME	Stephen J. Wright	SVM HeaderParse 0.2
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, suchasconvex quadratic programming, semide nite 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, semide nite programming, monotone linear complementarity, and convex programming over sets that can be characterized by self-concordant barrier functions. 1	SVM HeaderParse 0.2
YEAR	1997	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	32 found	ParsCit 1.0