Abstract
We study and analyze the algebraic structure of the arbitrary-order cones. We show that, unlike popularly perceived, the arbitrary-order cone is self-dual for any order greater than or equal to 1. We establish a spectral decomposition, consider the Jordan algebra associated with this cone, and prove that this algebra forms a Euclidean Jordan algebra with a certain inner product. We generalize some important notions and properties in the Euclidean Jordan algebra of the second-order cone to the Euclidean Jordan algebra of the arbitrary-order cone.
Similar content being viewed by others
References
Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. Ser. B 95, 3–51 (2003)
Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284, 193–228 (1998)
Alzalg, B.: Stochastic second-order cone programming: application models. Appl. Math. Model. 36, 5122–5134 (2012)
Maggioni, F., Potra, F., Bertocchi, M.: Stochastic second-order cone programming in mobile ad hoc networks. J. Optim. Theory Appl. 143, 309–328 (2009)
Bertazzi, L., Maggioni, F.: Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse. J. Optim. Theory Appl. 166, 321–342 (2015)
Krokhmal, P., Soberanis, P.: Risk optimization with \(p\)-order conic constraints: a linear programming approach. Eur. J. Oper. Res. 201, 653–671 (2010)
Xue, G., Ye, Y.: An efficient algorithm for minimizing a sum of \(p\)-norms. SIAM J. Optim. 10(2), 551–579 (2000)
Kloft, M., Brefeld, U., Sonnenburg, S., Zien, A.: \(l_p\)-norm multiple kernel learning. J. Mach. Learn. Res. 12, 953–997 (2011)
Krokhmal, P.: Higher moment risk measures. Quantum Finance 7, 373–387 (2007)
Faraut, J., Korányi, A.: Analysis on Symmetric Cones. Oxford University Press, Oxford, UK (1994)
Schmieta, S.H., Alizadeh, F.: Extension of primal–dual interior point methods to symmetric cones. Math. Program. Ser. A 96, 409–438 (2003)
Watkins, D.S.: Fundamentals of Matrix Computations, 2nd edn. Wiley, New York (2002)
Nesterov, Y.: Towards non-symmetric conic optimization. Optim. Methods Softw. 27, 893–917 (2012)
Glineur, F., Terlaky, T.: Conic formulation for \(l_p\)-norm optimization. J. Optim. Theory Appl. 122, 285–307 (2004)
Vinel, A., Krokhmal, P.: On valid inequalities for mixed integer \(p\)-order cone programming. J. Optim. Theory Appl. 160, 439–456 (2014)
Vinel, A., Krokhmal, P.: Polyhedral approximations in \(p\)-order cone programming. Optim. Methods Softw. 29, 1210–1237 (2014)
Gotoh, J., Uryasev, S.: Two pairs of families of polyhedral norms versus \(l_p\)-norms: proximity and applications in optimization. Math. Program. Ser. A 96, 1–41 (2015)
Acknowledgments
The author thanks the anonymous referees for their valuable suggestions to improve the paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Alzalg, B. The Algebraic Structure of the Arbitrary-Order Cone. J Optim Theory Appl 169, 32–49 (2016). https://doi.org/10.1007/s10957-016-0878-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-016-0878-1