Mathematical Programming

, Volume 100, Issue 3, pp 613–662 | Cite as

The volumetric barrier for convex quadratic constraints

Article
  • 76 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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5, 13–51 (1995)MathSciNetMATHGoogle Scholar
  2. 2.
    Anstreicher, K.M.: Large step volumetric potential reduction algorithms for linear programming. Ann. Oper. Res. 62, 521–538 (1996)MathSciNetMATHGoogle Scholar
  3. 3.
    Anstreicher, K.M.: Volumetric path following algorithms for linear programming. Math. Program. 76, 245–263 (1997)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Anstreicher, K.M.: On Vaidya’s volumetric cutting plane method for convex programming. Math. Oper. Res. 22, 63–89 (1997)MathSciNetMATHGoogle Scholar
  5. 5.
    Anstreicher, K.M.: The volumetric barrier for semidefinite programming. Math. Oper. Res. 25, 365–380 (2000)CrossRefMathSciNetMATHGoogle Scholar
  6. 6.
    Güler, O., Tunçel, L.: Characterization of the barrier parameter of homogeneous convex cones. Math. Program. 81, 55–76 (1998)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge, 1985Google Scholar
  8. 8.
    Nesterov, N., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia, 1994Google Scholar
  9. 9.
    Vaidya, P.M.: A new algorithm for minimizing convex functions over convex sets. Math. Program. 73, 291–341 (1996)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Vaidya, P.M., Atkinson, D.S.: A technique for bounding the number of iterations in path following algorithms. In: Complexity in Numerical Optimization, Pardalos, P.M., (ed.), World Scientific, Singapore, 1993, pp. 462–489Google Scholar
  11. 11.
    Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38, 49–95 (1996)MathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  1. 1.Department of Management SciencesUniversity of IowaUSA

Personalised recommendations