Abstract
We consider the logarithmic and the volumetric barrier functions used in interior point methods. In the case of the logarithmic barrier function, the analytic center of a level set is the point at which the central path intersects that level set. We prove that this also holds for the volumetric path. For the central path, it is also true that the analytic center of the optimal level set is the limit point of the central path. The only known case where this last property for the logarithmic barrier function fails occurs in case of semidefinite optimization in the absence of strict complementarity. For the volumetric path, we show with an example that this property does not hold even for a linear optimization problem in canonical form.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anstreicher K.M.: On Vaidya’s volumetric cutting plane method for convex programming. Math. Oper. Res. 22, 63–89 (1997)
Anstreicher K.M.: Towards a practical volumetric cutting plane method for convex programming. SIAM J. Optim. 9, 190–206 (1998)
Anstreicher K.M.: The volumetric barrier for semidefinite programming. Math. Oper. Res. 25(3), 365–380 (2000)
Atkinson D.S., Vaidya P.M.: A cutting plane algorithm for convex programming that uses analytic centers. Math. Program. 69, 1–43 (1995)
Deza A., Nematollahi E., Terlaky T.: How good are interior point methods? Klee–Minty cubes tighten iteration-complexity bounds. Math. Program. 113(1), 1–14 (2008)
Elhedhli, S., Goffin, J.L., Vial, J.P.: Nondifferentiable optimization: cutting plane methods. In: Encyclopedia of Optimization, Kluwer Academic Publishers, Boston (2001)
Halicka M., De Klerk E., Roos C.: On the convergence of the central path in semidefinite optimization. SIAM J. Optim. 12(4), 1090–1099 (2002)
De Klerk E.: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Kluwer, Dordrecht (2002)
Mehrotra, S., Zhifeng, L.: Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices. J. Glob. Optim. 1–27. doi:10.1007/s10898-010-9554-4 (2010)
Terlaky T., Roos C., Vial J.-P.: Interior Point Methods for Linear Optimization. Springer, Berlin (2005)
Vaidya, P.M.: A new algorithm for minimizing convex functions over convex sets. In: SFCS ’89: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp 338–343. IEEE Computer Society, Washington, DC (1989)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by a start-up grant of Lehigh University.
Rights and permissions
About this article
Cite this article
Mut, M., Terlaky, T. On the volumetric path. Optim Lett 6, 687–693 (2012). https://doi.org/10.1007/s11590-011-0293-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-011-0293-3