Skip to main content

Symmetric Cone Programming

Conic programming deals with an important class of tractable convex optimization problems that include linear programming, convex quadratic programming, and semidefinite programming. All these problems are treated in a unified theoretical framework for the design of algorithms, the analysis of their complexity, duality theory, perturbation analysis etc..

Past Members

Raphael Hauser
[an error occurred while processing this directive]