From Perspective Maps to Epigraphical Projections

Published Online:https://doi.org/10.1287/moor.2022.1317

References

  • [1] Aravkin AY, Burke JV, Drusvyatskiy D, Friedlander MP, MacPhee KJ (2018) Foundations of gauge and perspective duality. SIAM J. Optim. 28(3):2406–2434.CrossrefGoogle Scholar
  • [2] Attouch H (1984) Variational Convergence for Functions and Operators, Applied Mathematics Series (Pittman, Boston).Google Scholar
  • [3] Bauschke HH, Combettes PL (2017) Convex Analysis and Monotone Operator Theory in Hilbert Spaces, CMS Books in Mathematics, 2nd ed. (Springer, New York).CrossrefGoogle Scholar
  • [4] Beck A (2017) First-Order Methods in Optimization, MOS-SIAM Series on Optimization (MOS-SIAM, Philadelphia).Google Scholar
  • [5] Beck A, Teboulle M (2012) Smoothing and first order methods: A unified framework. SIAM J. Optim. 22(2):557–580.CrossrefGoogle Scholar
  • [6] Benko M, Gfrerer H, Outrata JV (2019) Calculus for directional limiting normal cones and subdifferentials. Set-Valued Variational Anal. 27:713–745.CrossrefGoogle Scholar
  • [7] Bougeard M, Penot JP, Pommellet A (1991) Toward minimal assumptions for the infimal convolution regularization. J. Approximation Theory 64(3):245–270.CrossrefGoogle Scholar
  • [8] Burke JV, Hoheisel T (2013) Epi-convergent smoothing with applications to convex composite functions. SIAM J. Optim. 23(3):1457–1479.CrossrefGoogle Scholar
  • [9] Burke JV, Hoheisel T (2017) Epi-convergence properties of smoothing by infimal convolution. Set-Valued Variational Anal. 25:1–23.CrossrefGoogle Scholar
  • [10] Burke JV, Hoheisel T, Nguyen QV (2021) A study of convex convex-composite functions via infimal convolution with applications. Math. Oper. Res. 46(4):1324–1348.LinkGoogle Scholar
  • [11] Chierchia G, Pustelnik N, Pesquet JC, Pesquet-Popescu B (2015) Epigraphical projection and proximal tools for solving constrained convex optimization problems. Signal Image Video Processing 9:1737–1749.CrossrefGoogle Scholar
  • [12] Clarke FH (1983) Optimization and Nonsmooth Analysis (John Wiley & Sons, New York).Google Scholar
  • [13] Combettes PL (2019) Perspective functions: Properties, constructions, and examples. Set-Valued Variational Anal. 26:247–264.CrossrefGoogle Scholar
  • [14] Combettes PL, Müller CL (2018) Perspective functions: Proximal calculus and applications in high-dimensional statistics. J. Math. Anal. Appl. 457(2):1283–1306.CrossrefGoogle Scholar
  • [15] Combettes PL, Müller CL (2020) Perspective maximum likelihood-type estimation via proximal decomposition. Electronic. J. Statist. 14(1):207–238.CrossrefGoogle Scholar
  • [16] Condat L (2016) Fast projection onto the simplex and l1 ball. Math. Programming Ser. A 158(1):575–585.CrossrefGoogle Scholar
  • [17] Condat L (2014) Accessed January 27, 2021, https://lcondat.github.io/software.html.Google Scholar
  • [18] Dontchev AL, Rockafellar RT (2014) Implicit Functions and Solution Mappings. A View from Variational Analysis, Springer Series in Operations Research and Financial Engineering (Springer-Verlag, New York).CrossrefGoogle Scholar
  • [19] Facchinei F, Pang J-S (2003) Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I and II (Springer, New York).Google Scholar
  • [20] Gfrerer H (2013a) On directional metric regularity, subregularity and optimality conditions for nonsmooth mathematical programs. Set-Valued Variational Anal. 21:151–176.CrossrefGoogle Scholar
  • [21] Gfrerer H (2013b) On directional metric subregularity and second-order optimality conditions for a class of nonsmooth mathematical programs. SIAM J. Optim. 23(1):632–665.CrossrefGoogle Scholar
  • [22] Gfrerer H, Outrata JV (2021) On a semismooth* Newton method for solving generalized equations. SIAM J. Optim. 31(1):489–517.CrossrefGoogle Scholar
  • [23] Ginchev I, Mordukhovich BS (2012) Directional subdifferentials and optimality conditions. Positivity 16:707–737.CrossrefGoogle Scholar
  • [24] Hiriart-Urruty JB, Lemaréchal C (2001) Fundamentals of Convex Analysis, Grundlehren Text Editions (Springer, Berlin/Heidelberg).CrossrefGoogle Scholar
  • [25] Hoheisel T (2019) Topics in Convex Analysis in Matrix Space, Lecture Notes, Spring School on Variational Analysis (Paseky nad Jizerou, Czech Republic).Google Scholar
  • [26] Khanh PD, Mordukhovich BS, Phat VT (2020) A generalized Newton method for subgradient systems. Preprint, submitted September 22, https://arxiv.org/abs/2009.10551.Google Scholar
  • [27] Klatte D, Kummer B (2002) Nonsmooth Equation in Optimization: Regularity, Calculus, Methods and Applications, Nonconvex Optimization and Its Applications, vol. 60 (Kluwer Academic Publishers, Dordrecht, Boston, London).Google Scholar
  • [28] Lemaréchal C, Sagastizábal C (1997) Practical aspects of the Moreau–Yosida Regularization: Theoretical preliminaries. SIAM J. Optim. 7(2):367–385.CrossrefGoogle Scholar
  • [29] Lewis AS (1995) The convex analysis of unitarily invariant matrix functions. J. Convex Anal. 2(1–2):173–183.Google Scholar
  • [30] Lewis AS (1996) Convex analysis on the Hermitian matrices. SIAM J. Optim. 6(1):164–177.CrossrefGoogle Scholar
  • [31] Liu J, Ye J (2009) Efficient Euclidean projections in linear time. Proc. 26th Annual Internat. Conf. Machine Learn., 657–664.Google Scholar
  • [32] Liu J, Ji S, Ye J (2009) SLEP: Sparse learning with efficient projections. Arizona State University. Accessed December 4, 2020, http://www.yelabs.net/software/SLEP/.Google Scholar
  • [33] Meng F, Sun D, Zhao G (2005) Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization. Math. Programming 104:561–581.CrossrefGoogle Scholar
  • [34] Meng F, Zhao G, Goh M, De Souza R (2008) Lagrangian-dual functions and Moreau-Yosida regularization. SIAM J. Optim. 19(1):39–61.CrossrefGoogle Scholar
  • [35] Milzarek A (2016) Numerical methods and second order theory for nonsmooth problems. Unpublished dissertation, Technical University of Munich, Germany.Google Scholar
  • [36] Mohammadi A, Sarabi ME (2020) Twice epi-differentiability of extended-real-valued functions with applications in composite optimization. SIAM J. Optim. 30(3):2379–2409.CrossrefGoogle Scholar
  • [37] Mordukhovich BS (2018) Variational Analysis and Applications, Springer Monographs in Mathematics (Springer International Publishing AG, Cham, Switzerland).CrossrefGoogle Scholar
  • [38] Neal P, Boyd S (2013) Proximal algorithms. Foundations Trends Optim. 1(3):123–231.Google Scholar
  • [39] Pang JS, Qi L (1995) A globally convergent Newton method for convex SC1 minimization problems. J. Optim. Theory Appl. 85(3):633–648.CrossrefGoogle Scholar
  • [40] Qi L, Sun J (1993) A nonsmooth version of Newton’s method. Math. Programming 58:353–367.CrossrefGoogle Scholar
  • [41] Rockafellar RT (1970) Convex Analysis, Princeton Mathematical Series, No. 28 (Princeton University Press, Princeton, NJ).CrossrefGoogle Scholar
  • [42] Rockafellar RT, Wets RJ-B (1998) Variational Analysis, Grundlehren der Mathematischen Wissenschaften, vol. 317 (Springer-Verlag, Berlin).CrossrefGoogle Scholar
  • [43] Shapiro A (1994) Directionally nondifferentiable metric projection. J. Optim. Theory Appl. 81(1):203–204.CrossrefGoogle Scholar
  • [44] Strömberg T (1996) The Operation of Infimal Convolution (Instytut Matematyczny Polskiej Akademi Nauk, Warsaw).Google Scholar
  • [45] Tofighi M, Kose K, Cetin AE (2014) Denoising using projections onto the epigraph set of convex cost functions. IEEE Internat. Conf. Image Processing, 2709–2713.Google Scholar
  • [46] Tofighi M, Bozkurt A, Kose K, Cetin AE (2014) Deconvolution using projections onto the epigraph set of a convex cost function. 22nd Signal Processing Comm. Appl. Conf., 1638–1641.Google Scholar
  • [47] Wang P-W, Wytock M, Kolter JZ (2016) Epigraph projections for fast general convex programming. Proc. 33rd Internat. Conf. Machine Learn., 2868–2877.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.