We present a general framework whereby analysis of interior-point algorithms for semidefinite programming can be extended verbatim to optimization problems over all classes of symmetric cones ...
We discuss some extremality issues concerning the circumradius, the inradius, and the condition number of a closed convex cone in Rn. The condition number refers to the ratio between the circumradius ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback