Variational Theory and Algorithms for a Class of Asymptotically Approachable Nonconvex Problems

References

• [1] Acerbi C (2002) Spectral measures of risk: A coherent representation of subjective risk aversion. J. Banking Finance 26(7):1505–1518.Crossref, Google Scholar
• [2] Ahmed S, Guan Y (2005) The inverse optimal value problem. Math. Program. 102(1):91–110.Crossref, Google Scholar
• [3] Beck A, Teboulle M (2012) Smoothing and first order methods: A unified framework. SIAM J. Optim. 22(2):557–580.Crossref, Google Scholar
• [4] Burke JV (1985) Descent methods for composite nondifferentiable optimization problems. Math. Program. 33(3):260–279.Crossref, Google Scholar
• [5] Burke JV, Ferris MC (1995) A Gauss-Newton method for convex composite optimization. Math. Program. 71(2):179–194.Crossref, Google Scholar
• [6] Burke JV, Hoheisel T (2013) Epi-convergent smoothing with applications to convex composite functions. SIAM J. Optim. 23(3):1457–1479.Crossref, Google Scholar
• [7] Burke JV, Hoheisel T (2017) Epi-convergence properties of smoothing by infimal convolution. Set-Valued Variational Anal. 25(1):1–23.Crossref, Google Scholar
• [8] Burke JV, Hoheisel T, Kanzow C (2013) Gradient consistency for integral-convolution smoothing functions. Set-Valued Variational Anal. 21(2):359–376.Crossref, Google Scholar
• [9] Burke JV, Lewis AS, Overton ML (2005) A robust gradient sampling algorithm for nonsmooth, nonconvex optimization. SIAM J. Optim. 15(3):751–779.Crossref, Google Scholar
• [10] Chen X (2012) Smoothing methods for nonsmooth, nonconvex minimization. Math. Program. 134(1):71–99.Crossref, Google Scholar
• [11] Clarke FH (1975) Generalized gradients and applications. Trans. Amer. Math. Soc. 205:247–262.Crossref, Google Scholar
• [12] Clarke FH (1990) Optimization and Nonsmooth Analysis (SIAM, Philadelphia).Crossref, Google Scholar
• [13] Cui Y, Pang JS (2021) Modern Nonconvex Nondifferentiable Optimization (SIAM, Philadelphia).Crossref, Google Scholar
• [14] Drusvyatskiy D, Paquette C (2019) Efficiency of minimizing compositions of convex functions and smooth maps. Math. Program. 178(1–2):503–558.Crossref, Google Scholar
• [15] Ermoliev YM, Norkin VI, Wets RJ (1995) The minimization of semicontinuous functions: Mollifier subgradients. SIAM J. Control Optim. 33(1):149–167.Crossref, Google Scholar
• [16] Fletcher R (1982) A model algorithm for composite nondifferentiable optimization problems. Math. Program. Stud. 17:67–76.Crossref, Google Scholar
• [17] Folland GB (1999) Real Analysis: Modern Techniques and Their Applications, vol. 40 (John Wiley & Sons, New York).Google Scholar
• [18] Goldstein AA (1977) Optimization of Lipschitz continuous functions. Math. Program. 13(1):14–22.Crossref, Google Scholar
• [19] Lewis AS, Wright SJ (2016) A proximal method for composite minimization. Math. Program. 158(1–2):501–546.Crossref, Google Scholar
• [20] Li H, Cui Y (2024) A decomposition algorithm for two-stage stochastic programs with nonconvex recourse. SIAM J. Optim. 34(1):306–335.Crossref, Google Scholar
• [21] Liu J, Cui Y, Pang JS, Sen S (2020) Two-stage stochastic programming with linearly bi-parameterized quadratic recourse. SIAM J. Optim. 30(3):2530–2558.Crossref, Google Scholar
• [22] Mordukhovich BS (1994) Generalized differential calculus for nonsmooth and set-valued mappings. J. Math. Anal. Appl. 183(1):250–288.Crossref, Google Scholar
• [23] Norton M, Khokhlov V, Uryasev S (2021) Calculating CVaR and bPOE for common probability distributions with application to portfolio optimization and density estimation. Ann. Oper. Res. 299(1):1281–1315.Crossref, Google Scholar
• [24] Paleologo G, Takriti S (2001) Bandwidth trading: A new market looking for help from the OR community. AIRO News 6(3):1–4.Google Scholar
• [25] Poliquin R, Rockafellar RT (1992) Amenable functions in optimization. Nonsmooth Optimization: Methods and Applications (Erice, 1991), 338–353.Google Scholar
• [26] Poliquin R, Rockafellar RT (1993) A calculus of epi-derivatives applicable to optimization. Canad. J. Math. 45(4):879–896.Crossref, Google Scholar
• [27] Rockafellar RT (1970) Convex Analysis, vol. 18 (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• [28] Rockafellar RT (1993) Lagrange multipliers and optimality. SIAM Rev. 35(2):183–238.Crossref, Google Scholar
• [29] Rockafellar RT, Uryasev S (2000) Optimization of conditional value-at-risk. J. Risk 2(3):21–42.Crossref, Google Scholar
• [30] Rockafellar RT, Wets RJ (2009) Variational Analysis, vol. 317 (Springer Science & Business Media, New York).Google Scholar
• [31] Royset JO (2020) Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation. Math. Program. 184(1):289–318.Crossref, Google Scholar
• [32] Royset JO (2022) Consistent approximations in composite optimization. Math. Program. 201(1–2):339–372.Crossref, Google Scholar
• [33] Shapiro A, Dentcheva D, Ruszczyński A (2021) Lectures on Stochastic Programming: Modeling and Theory, 3rd ed. (SIAM, Philadelphia).Crossref, Google Scholar
• [34] van Ackooij W (2020) A discussion of probability functions and constraints from a variational perspective. Set-Valued Variational Anal. 28(4):585–609.Crossref, Google Scholar
• [35] Yao Y, Lin Q, Yang T (2022) Large-scale optimization of partial AUC in a range of false positive rates. Adv. Neural Inform. Processing Systems 35:31239–31253.Google Scholar