Abstract
We call a positive semidefinite matrix whose elements are nonnegative a doubly nonnegative matrix, and the set of those matrices the doubly nonnegative cone (DNN cone). The DNN cone is not symmetric but can be represented as the projection of a symmetric cone embedded in a higher dimension. In Yoshise and Matsukawa (Proceedings of 2010 IEEE Multi-conference on Systems and Control, 2010), the authors demonstrated the efficiency of the DNN relaxation using the symmetric cone representation of the DNN cone. They showed that the DNN relaxation gives significantly tight bounds for a class of quadratic assignment problems, but the computational time is not affordable as long as we employ the symmetric cone representation. They then suggested a primal barrier function approach for solving the DNN optimization problem directly, instead of using the symmetric cone representation. However, most of existing studies on the primal barrier function approach have assumed the availability of a feasible interior point. This fact means that those studies are not inextricably tied to the practical usage. Motivated by these observations, we propose a primal barrier function Phase I algorithm for solving conic optimization problems over the closed convex cone K having the following properties: (a) its interior int K is not necessarily symmetric, (b) a self-concordant function f is defined over int K, and (c) its dual cone K* is not explicit or is intractable, all of which are observed when K is the DNN cone. We analyze the algorithm and provide a sufficient condition for finite termination.
Similar content being viewed by others
References
Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB: A Quadratic Assignment Problem Library. http://www.seas.upenn.edu/qaplib/
Bomze I.M, Dür M., De Klerk E., Roos C., Quist A.J., Terlaky T.: On copositive programming and standard quadratic optimization problems. J. Global Optim. 18, 301–320 (2000)
Burer S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120, 479–495 (2009)
De Klerk E., Pasechnik D.V.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12, 875–892 (2002)
De Klerk E., Pasechnik D.V., Sotirov R.: On semidefinite programming relaxations of the traveling salesman problem. SIAM J. Optim. 19, 1559–1573 (2008)
Güler O.: Hyperbolic polynomials and interior point methods for convex programming. Math. Oper. Res. 22, 350–377 (1997)
Iyengar, G., Phillips, D.J., Stein, C.: Feasible and accurate algorithms for covering semidefinite programs. In: Kaplan, H. (Ed.) SWAT 2010. LNCS, vol. 6139, pp.150–162. Springer, Berlin (2010)
Neasterov, Yu.E., Nemirovskii, A.S.: Interior-Point Polynomial Algorithm in Convex Programming. SIAM, Philadelphia (1994)
Nesterov, Yu.E.: Towards nonsymmetric conic optimization, CORE Discussion Paper No. 2006/28 (2006)
Povh J., Rendl F.: Copositive and semidefinite relaxations of the quadratic assignment problem. Discrete Optim. 16, 231–241 (2009)
Renegar, J.: A Mathematical View of Interior Point Methods for Convex Optimization, MPS-SIAM Series on Optimization (2001)
Renegar J.: Hyperbolic programs, and their derivative relaxations. Found. Comput. Math. 6, 59–79 (2005)
SDPA Online Solver. http://sdpa.indsys.chuo-u.ac.jp/portal/
Skajaa, A., Jørgensen, J.B., Hansen, P.C.: On implementing a homogeneous interior-point algorithm for nonsymmetric conic optimization. IMM-Technical Report 2011-02 (2011)
Sturm J.F., Zhang S.: On cones of nonnegative quadratic functions. Math. Oper. Res. 28, 246–267 (2003)
Yoshise, A., Matsukawa, Y.: On optimization over the doubly nonnegative cone. Proceedings of 2010 IEEE Multi-conference on Systems and Control, pp. 13–19 (2010)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported in part by Grants-in-Aid for Scientific Research ((B)23310099) of the Ministry of Education, Culture, Sports, Science and Technology of Japan.
About this article
Cite this article
Matsukawa, Y., Yoshise, A. A primal barrier function Phase I algorithm for nonsymmetric conic optimization problems. Japan J. Indust. Appl. Math. 29, 499–517 (2012). https://doi.org/10.1007/s13160-012-0081-1
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13160-012-0081-1
Keywords
- Doubly nonnegative cone
- Nonsymmetric conic optimization
- Primal barrier function
- Self-concordant function
- Phase I algorithm