From Perspective Maps to Epigraphical Projections
References
- [1] (2018) Foundations of gauge and perspective duality. SIAM J. Optim. 28(3):2406–2434.Crossref, Google Scholar
- [2] (1984) Variational Convergence for Functions and Operators, Applied Mathematics Series (Pittman, Boston).Google Scholar
- [3] (2017) Convex Analysis and Monotone Operator Theory in Hilbert Spaces, CMS Books in Mathematics, 2nd ed. (Springer, New York).Crossref, Google Scholar
- [4] (2017) First-Order Methods in Optimization, MOS-SIAM Series on Optimization (MOS-SIAM, Philadelphia).Google Scholar
- [5] (2012) Smoothing and first order methods: A unified framework. SIAM J. Optim. 22(2):557–580.Crossref, Google Scholar
- [6] (2019) Calculus for directional limiting normal cones and subdifferentials. Set-Valued Variational Anal. 27:713–745.Crossref, Google Scholar
- [7] (1991) Toward minimal assumptions for the infimal convolution regularization. J. Approximation Theory 64(3):245–270.Crossref, Google Scholar
- [8] (2013) Epi-convergent smoothing with applications to convex composite functions. SIAM J. Optim. 23(3):1457–1479.Crossref, Google Scholar
- [9] (2017) Epi-convergence properties of smoothing by infimal convolution. Set-Valued Variational Anal. 25:1–23.Crossref, Google Scholar
- [10] (2021) A study of convex convex-composite functions via infimal convolution with applications. Math. Oper. Res. 46(4):1324–1348.Link, Google Scholar
- [11] (2015) Epigraphical projection and proximal tools for solving constrained convex optimization problems. Signal Image Video Processing 9:1737–1749.Crossref, Google Scholar
- [12] (1983) Optimization and Nonsmooth Analysis (John Wiley & Sons, New York).Google Scholar
- [13] (2019) Perspective functions: Properties, constructions, and examples. Set-Valued Variational Anal. 26:247–264.Crossref, Google Scholar
- [14] (2018) Perspective functions: Proximal calculus and applications in high-dimensional statistics. J. Math. Anal. Appl. 457(2):1283–1306.Crossref, Google Scholar
- [15] (2020) Perspective maximum likelihood-type estimation via proximal decomposition. Electronic. J. Statist. 14(1):207–238.Crossref, Google Scholar
- [16] (2016) Fast projection onto the simplex and l1 ball. Math. Programming Ser. A 158(1):575–585.Crossref, Google Scholar
- [17] (2014) Accessed January 27, 2021, https://lcondat.github.io/software.html.Google Scholar
- [18] (2014) Implicit Functions and Solution Mappings. A View from Variational Analysis, Springer Series in Operations Research and Financial Engineering (Springer-Verlag, New York).Crossref, Google Scholar
- [19] (2003) Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I and II (Springer, New York).Google Scholar
- [20] (2013a) On directional metric regularity, subregularity and optimality conditions for nonsmooth mathematical programs. Set-Valued Variational Anal. 21:151–176.Crossref, Google Scholar
- [21] (2013b) On directional metric subregularity and second-order optimality conditions for a class of nonsmooth mathematical programs. SIAM J. Optim. 23(1):632–665.Crossref, Google Scholar
- [22] (2021) On a semismooth* Newton method for solving generalized equations. SIAM J. Optim. 31(1):489–517.Crossref, Google Scholar
- [23] (2012) Directional subdifferentials and optimality conditions. Positivity 16:707–737.Crossref, Google Scholar
- [24] (2001) Fundamentals of Convex Analysis, Grundlehren Text Editions (Springer, Berlin/Heidelberg).Crossref, Google Scholar
- [25] (2019) Topics in Convex Analysis in Matrix Space, Lecture Notes, Spring School on Variational Analysis (Paseky nad Jizerou, Czech Republic).Google Scholar
- [26] (2020) A generalized Newton method for subgradient systems. Preprint, submitted September 22, https://arxiv.org/abs/2009.10551.Google Scholar
- [27] (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] (1997) Practical aspects of the Moreau–Yosida Regularization: Theoretical preliminaries. SIAM J. Optim. 7(2):367–385.Crossref, Google Scholar
- [29] (1995) The convex analysis of unitarily invariant matrix functions. J. Convex Anal. 2(1–2):173–183.Google Scholar
- [30] (1996) Convex analysis on the Hermitian matrices. SIAM J. Optim. 6(1):164–177.Crossref, Google Scholar
- [31] (2009) Efficient Euclidean projections in linear time. Proc. 26th Annual Internat. Conf. Machine Learn., 657–664.Google Scholar
- [32] (2009) SLEP: Sparse learning with efficient projections. Arizona State University. Accessed December 4, 2020, http://www.yelabs.net/software/SLEP/.Google Scholar
- [33] (2005) Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization. Math. Programming 104:561–581.Crossref, Google Scholar
- [34] (2008) Lagrangian-dual functions and Moreau-Yosida regularization. SIAM J. Optim. 19(1):39–61.Crossref, Google Scholar
- [35] (2016) Numerical methods and second order theory for nonsmooth problems. Unpublished dissertation, Technical University of Munich, Germany.Google Scholar
- [36] (2020) Twice epi-differentiability of extended-real-valued functions with applications in composite optimization. SIAM J. Optim. 30(3):2379–2409.Crossref, Google Scholar
- [37] (2018) Variational Analysis and Applications, Springer Monographs in Mathematics (Springer International Publishing AG, Cham, Switzerland).Crossref, Google Scholar
- [38] (2013) Proximal algorithms. Foundations Trends Optim. 1(3):123–231.Google Scholar
- [39] (1995) A globally convergent Newton method for convex SC1 minimization problems. J. Optim. Theory Appl. 85(3):633–648.Crossref, Google Scholar
- [40] (1993) A nonsmooth version of Newton’s method. Math. Programming 58:353–367.Crossref, Google Scholar
- [41] (1970) Convex Analysis, Princeton Mathematical Series, No. 28 (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
- [42] (1998) Variational Analysis, Grundlehren der Mathematischen Wissenschaften, vol. 317 (Springer-Verlag, Berlin).Crossref, Google Scholar
- [43] (1994) Directionally nondifferentiable metric projection. J. Optim. Theory Appl. 81(1):203–204.Crossref, Google Scholar
- [44] (1996) The Operation of Infimal Convolution (Instytut Matematyczny Polskiej Akademi Nauk, Warsaw).Google Scholar
- [45] (2014) Denoising using projections onto the epigraph set of convex cost functions. IEEE Internat. Conf. Image Processing, 2709–2713.Google Scholar
- [46] (2014) Deconvolution using projections onto the epigraph set of a convex cost function. 22nd Signal Processing Comm. Appl. Conf., 1638–1641.Google Scholar
- [47] (2016) Epigraph projections for fast general convex programming. Proc. 33rd Internat. Conf. Machine Learn., 2868–2877.Google Scholar

