Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
From MaRDI portal
Publication:4340801
DOI10.1137/S1052623494267127zbMath0876.49019OpenAlexW2057681237MaRDI QIDQ4340801
Claudia A. Sagastizábal, Claude Lemaréchal
Publication date: 12 June 1997
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623494267127
convex optimizationsubdifferentialmathematical programmingMoreau-Yosida regularizationproximal pointsecond-order differentiability
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52)
Related Items (73)
An efficient semismooth Newton method for adaptive sparse signal recovery problems ⋮ On the relation between \(\mathcal U\)-Hessians and second-order epi-derivatives ⋮ Forward-backward quasi-Newton methods for nonsmooth optimization problems ⋮ Fast Algorithms for LS and LAD-Collaborative Regression ⋮ First-order inertial algorithms involving dry friction damping ⋮ Tuning strategy for the proximity parameter in convex minimization ⋮ A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems ⋮ Epi-convergence: the Moreau envelope and generalized linear-quadratic functions ⋮ Explicit formulas for 𝐶^{1,1} Glaeser-Whitney extensions of 1-Taylor fields in Hilbert spaces ⋮ Survey of Bundle Methods for Nonsmooth Optimization ⋮ A Method for Minimization of Quasidifferentiable Functions ⋮ Helping you finding an appropriate regularization process ⋮ The \(\mathcal{VU}\)-decomposition to the proper convex function ⋮ DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS ⋮ A preconditioning proximal Newton method for nondifferentiable convex optimization ⋮ An ODE-like nonmonotone method for nonsmooth convex optimization ⋮ Partial Smoothness and Constant Rank ⋮ Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription ⋮ A bundle modification strategy for convex minimization ⋮ Composite proximal bundle method ⋮ Fast Moreau envelope computation I: Numerical algorithms ⋮ The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions ⋮ Generalized greedy alternatives ⋮ A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization ⋮ Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization ⋮ An efficient conjugate gradient method with strong convergence properties for non-smooth optimization ⋮ Practicable robust stochastic optimization under divergence measures with an application to equitable humanitarian response planning ⋮ Finding robust minimizer for non-convex phase retrieval ⋮ An accelerated variance reducing stochastic method with Douglas-Rachford splitting ⋮ Conjugate gradient type methods for the nondifferentiable convex minimization ⋮ Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters ⋮ Accelerated gradient methods combining Tikhonov regularization with geometric damping driven by the Hessian ⋮ A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization ⋮ Finite Convergence of Proximal-Gradient Inertial Algorithms Combining Dry Friction with Hessian-Driven Damping ⋮ An implementable proximal point algorithmic framework for nuclear norm minimization ⋮ A unified primal-dual algorithm framework based on Bregman iteration ⋮ A modified conjugate gradient method for general convex functions ⋮ An alternating linearization method with inexact data for bilevel nonsmooth convex optimization ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization ⋮ On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming ⋮ A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization ⋮ An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming ⋮ Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice ⋮ A fast gradient and function sampling method for finite-max functions ⋮ A Guide to the TV Zoo ⋮ 𝒱𝒰-smoothness and proximal point results for some nonconvex functions ⋮ An approximate decomposition algorithm for convex minimization ⋮ The chain rule for VU-decompositions of nonsmooth functions ⋮ On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs ⋮ Weakly constrained minimization: application to the estimation of images and signals involving constant regions ⋮ A new trust region algorithm for nonsmooth convex minimization ⋮ A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems ⋮ A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems ⋮ A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications ⋮ The 𝒰-Lagrangian of a convex function ⋮ Lagrange optimality system for a class of nonsmooth convex optimization ⋮ An efficient Hessian based algorithm for singly linearly and box constrained least squares regression ⋮ An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration ⋮ Globally convergent BFGS method for nonsmooth convex optimization ⋮ An Algorithm Using Trust Region Strategy for Minimization of a Nondifferentiable Function ⋮ An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems ⋮ Active‐Set Newton Methods and Partial Smoothness ⋮ A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima ⋮ A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems ⋮ Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization ⋮ A \(\mathcal{VU}\)-algorithm for convex minimization ⋮ On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming ⋮ Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction ⋮ Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise ⋮ Efficient Sparse Hessian-Based Semismooth Newton Algorithms for Dantzig Selector ⋮ A memory gradient method for non-smooth convex optimization ⋮ A Moreau-Yosida regularization for Markov decision processes ⋮ Convergence of Prox-Regularization Methods for Generalized Fractional Programming
This page was built for publication: Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
