Exterior minimum-penalty path-following methods in semidefinite programming

A semidefinite programming problem is a mathematical program in which the objective function is linear in the unknowns and the constraint set is defined by a linear matrix inequality. This problem is nonlinear, nondifferentiable but convex. It covers several standard problems, such as linear and qua...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of optimization theory and applications 1999-02, Vol.100 (2), p.327-348
Hauptverfasser:	FAN, M. K. H, GONG, Y
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Exact sciences and technology Mathematical programming Operational research and scientific management Operational research. Management science Semidefinite programming
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!