Epi-convergent Smoothing with Applications to Convex Composite Functions
From MaRDI portal
Publication:2866193
DOI10.1137/120889812zbMath1278.49018arXiv1208.6591OpenAlexW1992726305MaRDI QIDQ2866193
Publication date: 13 December 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.6591
epi-convergenceKarush-Kuhn-Tucker conditionssmoothing methodMoreau envelopeinfimal convolutionsubdifferential calculusconvex composite function
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Related Items
A smoothing trust region filter algorithm for nonsmooth least squares problems, An approximation scheme for a class of risk-averse stochastic equilibrium problems, Epi-convergence: the Moreau envelope and generalized linear-quadratic functions, Helping you finding an appropriate regularization process, An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming, The subdifferential of measurable composite max integrands and smoothing approximation, Consistent approximations in composite optimization, An Approximation Scheme for Distributionally Robust Nonlinear Optimization, A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming, Gradient consistency for integral-convolution smoothing functions, A SUFFICIENT MINIMALITY CONDITION FOR CONVEX COMPOSITE FUNCTIONS, Epi-convergence properties of smoothing by infimal convolution, Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case, Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity, One-Step Estimation with Scaled Proximal Methods, High-Order Optimization Methods for Fully Composite Problems, A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications