Exact and Heuristic Solution Techniques for Mixed-Integer Quantile Minimization Problems

References

• Alexander GJ, Baptista AM (2002) Economic implications of using a mean-VaR model for portfolio selection: A comparison with mean-variance analysis. J. Econom. Dynamics Control 26(7–8):1159–1193.Crossref, Google Scholar
• Alexander GJ, Baptista AM (2004) A comparison of VaR and CVaR constraints on portfolio selection with the mean-variance model. Management Sci. 50(9):1261–1273.Link, Google Scholar
• Artzner P, Delbaen F, Eber J-M, Heath D (1999) Coherent measures of risk. Math. Finance 9(3):203–228.Crossref, Google Scholar
• Benati S, Rizzi R (2007) A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem. Eur. J. Oper. Res. 176:423–434.Crossref, Google Scholar
• Boyd S, Parikh N, Chu E (2011) Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers (Now Publishers, Hanover, MD).Google Scholar
• Fischer PF (1997) An overlapping Schwarz method for spectral element solution of the incompressible Navier–Stokes equations. J. Comput. Phys. 133(1):84–101.Crossref, Google Scholar
• Gaivoronski AA, Pflug G (1999) Finding optimal portfolios with constraints on value at risk. Proc. III Stockholm Seminar on Risk Behavior and Risk Management (Dunod, Malakoff, France).Google Scholar
• Gaivoronski AA, Pflug G (2005) Value-at-risk in portfolio optimization: Properties and computational approach. J. Risk 7(2):1–31.Crossref, Google Scholar
• Garey MR, Johnson DS (1979) Computers and Intractability, vol. 174 (Freeman, San Francisco).Google Scholar
• Gatzert N, Wesker H (2012) A comparative assessment of Basel II/III and Solvency II. Geneva Papers Risk Insurance Issues Practice 37(3):539–570.Crossref, Google Scholar
• Geißler B, Morsi A, Schewe L, Schmidt M (2015) Solving power-constrained gas transportation problems using an MIP-based alternating direction method. Comput. Chemical Engrg. 82:303–317.Crossref, Google Scholar
• Geißler B, Morsi A, Schewe L, Schmidt M (2018) Solving highly detailed gas transport MINLPs: Block separability and penalty alternating direction methods. INFORMS J. Comput. 30(2):309–323.Link, Google Scholar
• Glowinski R, Marroco A (1975) Sur l’approximation, par éléments finis d’ordre un, et la résolution, par pénalisation-dualité d’une classe de problèmes de Dirichlet non linéaires. ESAIM: Mathematical Modelling and Numerical Analysis-Modélisation Mathématique et Analyse Numérique, 41–76.Google Scholar
• Kleinert T, Schmidt M (2019) Computing feasible points of bilevel problems with a penalty alternating direction method. INFORMS J. Comput. 33(1):198–215.Google Scholar
• Kleinert T, Labbé M, Plein F, Schmidt M (2021) Closing the gap in linear bilevel optimization: A new valid primal-dual inequality. Optim. Lett. 15:1027–1040.Crossref, Google Scholar
• Lin C-C (2009) Comments on “A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem”. Eur. J. Oper. Res. 194:339–341.Crossref, Google Scholar
• Liu R, Lin Z, Su Z (2013) Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning. Proc. Asian Conf. on Machine Learn. (PMLR, New York), 116–132.Google Scholar
• Mansini R, Ogryczak W, Speranza MG (2003) LP solvable models for portfolio optimization: A classification and computational comparison. IMA J. Management Math. 14(3):187–220.Google Scholar
• Markowitz H (1952) Portfolio selection. J. Finance 7(1):77–91.Google Scholar
• Na S, Shin S, Anitescu M, Zavala VM (2022) On the convergence of overlapping Schwarz decomposition for nonlinear optimal control. IEEE Trans. Automatic Control 67(11):5996–6011.Google Scholar
• Puerto J, Rodríguez-Madrena M, Scozzari A (2020) Clustering and portfolio selection problems: A unified framework. Comput. Oper. Res. 117:104891.Crossref, Google Scholar
• Puerto J, Ricca F, Rodríguez-Madrena M, Scozzari A (2022) A combinatorial optimization approach to scenario filtering in portfolio selection. Computers & Operations Research 142:14.Crossref, Google Scholar
• Qiu F, Ahmed S, Dey SS, Wolsey LA (2014) Covering linear programming with violations. INFORMS J. Comput. 26(3):531–546.Link, Google Scholar
• Schewe L, Schmidt M, Weninger D (2020) A decomposition heuristic for mixedinteger supply chain problem. Oper. Res. Lett. 48(3):225–232.Crossref, Google Scholar
• Shin S, Zavala VM, Anitescu M (2020) Decentralized schemes with overlap for solving graph-structured optimization problems. IEEE Trans. Control Network Systems 7(3):1225–1236.Crossref, Google Scholar
• Silverman BW (2018) Density Estimation for Statistics and Data Analysis (Routledge, Oxfordshire, UK).Crossref, Google Scholar
• Song Y, Luedtke JR (2013) Branch-and-cut approaches for chance-constrained formulations of reliable network design problems. Math. Programming Comput. 5(4):397–432.Crossref, Google Scholar
• Song Y, Luedtke JR, Kücükyavuz S (2014) Chance-constrained binary packing problems. INFORMS J. Comput. 26(4):735–747.Link, Google Scholar
• Tanner MW, Ntaimo L (2010) IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation. Eur. J. Oper. Res. 207(1):290–296.Crossref, Google Scholar