Results 1 
4 of
4
Determinant maximization with linear matrix inequality constraints
 SIAM Journal on Matrix Analysis and Applications
, 1998
"... constraints ..."
Convex Optimization & Euclidean Distance Geometry
, 2005
"... ISBN 9781847280640 (International) Version 07.07.2006 available in print as conceived in color. cybersearch: I. convex optimization II. convex cones III. convex geometry IV. distance geometry V. distance matrix programs and graphics by Matlab typesetting by with donations from SIAM and AMS. This ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
ISBN 9781847280640 (International) Version 07.07.2006 available in print as conceived in color. cybersearch: I. convex optimization II. convex cones III. convex geometry IV. distance geometry V. distance matrix programs and graphics by Matlab typesetting by with donations from SIAM and AMS. This searchable electronic color pdfBook is clicknavigable within the text by page, section, subsection, chapter, theorem, example, definition, cross reference, citation, equation, figure, table, and hyperlink. A pdfBook has no electronic copy protection and can be read and printed by most computers. The publisher hereby grants the right to reproduce this work in any format but limited to personal use. �2005 Jon Dattorro
Cascading: an adjusted exchange method for robust conic programming
 Central European Journal of Operations Research
"... It is well known that the robust counterpart introduced by BenTal and Nemirovski [2] increases the numerical complexity of the solution compared to the original problem. Kočvara, Nemirovski and Zowe therefore introduced in [9] an approximation algorithm for the special case of robust material optim ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
It is well known that the robust counterpart introduced by BenTal and Nemirovski [2] increases the numerical complexity of the solution compared to the original problem. Kočvara, Nemirovski and Zowe therefore introduced in [9] an approximation algorithm for the special case of robust material optimization, called cascading. As the title already indicates, we will show that their method can be seen as an adjustment of standard exchange methods to semiinfinite conic programming. We will see that the adjustment can be motivated by a suitable reformulation of the robust conic problem.
EUCLIDEAN DISTANCE GEOMETRY Meboo Convex Optimization Euclidean Distance Geometry
"... This is version 2013.03.30: available in print, as conceived, in color. cybersearch: I. convex optimization II. semidefinite program III. rank constraint IV. convex geometry V. distance matrix VI. convex cones VII. cardinality minimization programs by Matlab typesetting by with donations from SIAM a ..."
Abstract
 Add to MetaCart
This is version 2013.03.30: available in print, as conceived, in color. cybersearch: I. convex optimization II. semidefinite program III. rank constraint IV. convex geometry V. distance matrix VI. convex cones VII. cardinality minimization programs by Matlab typesetting by with donations from SIAM and AMS. This searchable electronic color pdfBook is clicknavigable within the text by page, section, subsection, chapter, theorem, example, definition, cross reference, citation, equation, figure, table, and hyperlink. A pdfBook has no electronic copy protection and can be read and printed by most computers. The publisher hereby grants the right to reproduce this work in any format but limited to personal use.