Mathematical Programming

, Volume 100, Issue 3, pp 613–662

The volumetric barrier for convex quadratic constraints

Article

DOI: 10.1007/s10107-003-0513-4

Cite this article as:
Anstreicher, K. Math. Program., Ser. A (2004) 100: 613. doi:10.1007/s10107-003-0513-4
  • 70 Downloads

Abstract.

Let Open image in new window where Open image in new window and Open image in new windowi is an n×n positive semidefinite matrix. We prove that the volumetric and combined volumetric-logarithmic barriers for Open image in new window are Open image in new window and Open image in new window self-concordant, respectively. Our analysis uses the semidefinite programming (SDP) representation for the convex quadratic constraints defining Open image in new window, and our earlier results on the volumetric barrier for SDP. The self-concordance results actually hold for a class of SDP problems more general than those corresponding to the SDP representation of Open image in new window.

Keywords

Volumetric barrier Convex quadratic constraints Semidefinite programming 

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  1. 1.Department of Management SciencesUniversity of IowaUSA