References
- F. Alizadeh and D. Goldfarb, Second-order cone programming, Math. Program. 95 (2003), pp. 3–51. Available at http://dx.doi.org/10.1007/s10107-002-0339-5. doi: 10.1007/s10107-002-0339-5
- P. Artzner, F. Delbaen, J.M. Eber, and D. Heath, Coherent measures of risk, Math. Finance 9 (1999), pp. 203–228. Available at http://dx.doi.org/10.1111/1467-9965.00068. doi: 10.1111/1467-9965.00068
- A. Atamtürk and V. Narayanan, Conic mixed-integer rounding cuts, Math. Program. 122 (2010), pp. 1–20. Available at http://dx.doi.org/10.1007/s10107-008-0239-4. doi: 10.1007/s10107-008-0239-4
- A. Atamtürk and V. Narayanan, Lifting for conic mixed-integer programming, Math. Program. 126 (2011), pp. 351–363. Available at http://dx.doi.org/10.1007/s10107-009-0282-9. doi: 10.1007/s10107-009-0282-9
- N.S. Aybat and G. Iyengar, Unified approach for minimizing composite norms, Math. Program. (2012). Available at http://arxiv.org/abs/1005.4733.
- N.S. Aybat and G. Iyengar, An augmented Lagrangian method for conic convex programming, Working paper, 2013. Available at http://arxiv.org/abs/1302.6322.
- P. Belotti, J. Goez, T. Polik I. Ralphs, and T. Terlaky, A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization, Optimization. (2012). Available at http://www.optimization-online.org/DB_HTML/2012/06/3494.html.
- A. Ben-Tal and A. Nemirovski, Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, MPS/SIAM Series on Optimization, Vol. 2, SIAM, Philadelphia, PA, 2001.
- A. Ben-Tal and A. Nemirovski, On polyhedral approximations of the second-order cone, Math. Oper. Res. 26 (2001), pp. 193–205. Available at http://dx.doi.org/10.1287/moor.26.2.193.10561. doi: 10.1287/moor.26.2.193.10561
- M.T. Çezik and G. Iyengar, Cuts for mixed 0-1 conic programming, Math. Program. 104 (2005), pp. 179–202. Available at http://dx.doi.org/10.1007/s10107-005-0578-3. doi: 10.1007/s10107-005-0578-3
- F. Glineur, Computational experiments with a linear approximation of second order cone optimization, Tech. Rep. 0001, Service de Mathématique et de Recherche Opérationnelle, Faculté Polytechnique de Mons, Mons, 2000.
- F. Glineur and T. Terlaky, Conic formulation for lp-norm optimization, J. Optim. Theory Appl. 122 (2004), pp. 285–307. Available at http://dx.doi.org/10.1023/B:JOTA.0000042522.65261.51. doi: 10.1023/B:JOTA.0000042522.65261.51
- V. Kaibel and K. Pashkovich, Constructing extended formulations from reflection relations, in Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 6655, Springer, Heidelberg, 2011, pp. 287–300. Available at http://dx.doi.org/10.1007/978-3-642-20807-2_23.
- P.A. Krokhmal, Higher moment coherent risk measures, Quant. Finance 7 (2007), pp. 373–387. Available at http://dx.doi.org/10.1080/14697680701458307. doi: 10.1080/14697680701458307
- P.A. Krokhmal and P. Soberanis, Risk optimization with p-order conic constraints: A linear programming approach, Eur. J. Oper. Res. 201 (2010), pp. 653–671, http://dx.doi.org/10.1016/j.ejor.2009.03.053. doi: 10.1016/j.ejor.2009.03.053
- G. Lan and R.D.C. Monteiro, Iteration-complexity of first-order penalty methods for convex programming, Math. Program. 138 (2013), pp. 115–139. Available at http://dx.doi.org/10.1007/s10107-012-0588-x. doi: 10.1007/s10107-012-0588-x
- G. Lan, Z. Lu, and R.D.C. Monteiro, Primal-dual first-order methods with iteration-complexity for cone programming, Math. Program. 126 (2011), pp. 1–29. Available at http://dx.doi.org/10.1007/s10107-008-0261-6. doi: 10.1007/s10107-008-0261-6
- Y. Morenko, A. Vinel, Z. Yu, and P. Krokhmal, On p-norm linear discrimination, Eur. J. Oper. Res. 231 (2013), pp. 784–789. doi: 10.1016/j.ejor.2013.06.053
- Y. Nesterov, Towards non-symmetric conic optimization, Optim. Methods Softw. 27 (2012), pp. 893–917. doi: 10.1080/10556788.2011.567270
- J. von Neumann and O. Morgenstern, Theory of Games and Economic Behavior, 1953rd ed., Princeton University Press, Princeton, NJ, 1944.
- Y.E. Nesterov and A. Nemirovski, Interior Point Polynomial Algorithms in Convex Programming, Studies in Applied Mathematics, Vol. 13, SIAM, Philadelphia, PA, 1994.
- T. Terlaky, On lp programming, Eur. J. Oper. Res. 22 (1985), pp. 70–100. Available at http://dx.doi.org/10.1016/0377-2217(85)90116-X. doi: 10.1016/0377-2217(85)90116-X
- J.P. Vielma, S. Ahmed, and G.L. Nemhauser, A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs, INFORMS J. Comput. 20 (2008), pp. 438–450. Available at http://dx.doi.org/10.1287/ijoc.1070.0256. doi: 10.1287/ijoc.1070.0256
- A. Vinel and P. Krokhmal, On valid inequalities for mixed integer p-order cone programming, J. Optim. Theory Appl. (2013). Available at http://dx.doi.org/10.1007/s10957-013-0315-7.
- G. Xue and Y. Ye, An efficient algorithm for minimizing a sum of p-norms, SIAM J. Optim. 10 (2000), pp. 551–579. Available at http://dx.doi.org/10.1137/S1052623497327088. doi: 10.1137/S1052623497327088