Aspects of Semidefinite Programming
Subtitle: Interior Point Algorithms and Selected Applications (Applied Optimization)
Edition: 1 edition
Publisher: Springer
Published: March 31, 2002
Language: eng
Format: Hardcover
Number of pages: 300
ISBN-13: 9781402005473
Subjects: Applied mathematics; Computer Programming; Optimization; Science; Control Theory; Linear Programming; Mathematics; Science/Mathematics; General; Mathematics / Linear Programming; Advanced; Combinatorics
First sentence: All convex optimization problems can in principle be restated as so-called conic linear programs (conic LP's for short); these are problems where the objective function is linear, and the feasible set is the intersection of an affine space with a convex cone.