Abstract | ||
---|---|---|
We consider the volumetric barrier for semidefinite programming, or "generalized" volumetric barrier, as introduced by Nesterov and Nemirovskii. We extend several fundamental properties of the volumetric barrier for a polyhedral set to the semidefinite case. Our analysis facilitates a simplified proof of self-concordance for the semidefinite volumetric barrier, as well as for the combined volumetric-logarithmic barrier for semidefinite programming. For both of these barriers we obtain self-concordance parameters equal to those previously shown to hold in the polyhedral case. |
Year | DOI | Venue |
---|---|---|
2000 | 10.1287/moor.25.3.365.12212 | Math. Oper. Res. |
Keywords | DocType | Volume |
fundamental property,combined volumetric-logarithmic barrier,Volumetric Barrier,volumetric barrier,semidefinite volumetric barrier,Semidefinite Programming,semidefinite case,polyhedral case,semidefinite programming,self-concordance parameter | Journal | 25 |
Issue | ISSN | Citations |
3 | 0364-765X | 5 |
PageRank | References | Authors |
0.50 | 6 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Kurt M. Anstreicher | 1 | 633 | 86.40 |