Fast Moreau envelope computation I: Numerical algorithms

DOI10.1007/s11075-006-9056-0zbMath1116.65027OpenAlexW2052622865MaRDI QIDQ870763

Yves Lucet

Publication date: 15 March 2007

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-006-9056-0

zbMATH Keywords

Legendre-Fenchel transformMoreau-Yosida approximateproximal mappingdiscrete Moreau envelopequadratic worst-case time complexity

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Related Items

Graph-Matrix Calculus for Computational Convex Analysis, The piecewise linear-quadratic model for computational convex analysis, Explicit formulas for 𝐶^{1,1} Glaeser-Whitney extensions of 1-Taylor fields in Hilbert spaces, A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions, Computing the conjugate of convex piecewise linear-quadratic bivariate functions, Fast Moreau envelope computation I: Numerical algorithms, Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis, A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems, Convexity of the proximal average, A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions, Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions, Compensated convexity on bounded domains, mixed Moreau envelopes and computational methods, Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness, Techniques and Open Questions in Computational Convex Analysis, Duality and Convex Programming, Computation of the epsilon-subdifferential of convex piecewise linear-quadratic functions in optimal worst-case time

Uses Software

• na24
• na13

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uniform prox-regularity of functions and epigraphs in Hilbert spaces
• Fast Moreau envelope computation I: Numerical algorithms
• The inviscid Burgers equation with initial data of Brownian type
• Variable metric bundle methods: From conceptual to implementable forms
• A preconditioning proximal Newton method for nondifferentiable convex optimization
• Coupling the proximal point algorithm with approximation methods
• Faster than the fast Legendre transform, the linear-time Legendre transform
• Properties of the Moreau-Yosida regularization of a piecewise \(C^2\) convex function
• The decay of multiscale signals -- a deterministic model of Burgers turbulence
• On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
• Prox-regular functions in Hilbert spaces
• A family of variable metric proximal methods
• On the relation between \(\mathcal U\)-Hessians and second-order epi-derivatives
• Prox-regularity of functions and sets in Banach spaces
• A fast Legendre transform algorithm and applications to the adhesion model
• A quasi-second-order proximal bundle algorithm
• A fast computational algorithm for the Legendre-Fenchel transform
• Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
• A \(\mathcal{VU}\)-algorithm for convex minimization
• On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
• A Convergence Theory for Saddle Functions
• Lipschitz $r$-continuity of the approximative subdifferential of a convex function.
• Submonotone mappings and the proximal point algorithm
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Monotone Operators and the Proximal Point Algorithm
• A Variable Metric Proximal Point Algorithm for Monotone Operators
• Coupling proximal methods and variational convergence
• Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
• On the decay of Burgers turbulence
• Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
• Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
• Kicked Burgers turbulence
• 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
• On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Entropy-Like Proximal Methods in Convex Programming
• The 𝒰-Lagrangian of a convex function
• Convergence analysis of a proximal newton method¹
• Generalized Hessian Properties of Regularized Nonsmooth Functions
• Prox-regular functions in variational analysis
• Fast Legendre–Fenchel Transform and Applications to Hamilton–Jacobi Equations and Conservation Laws
• Proximité et dualité dans un espace hilbertien
• Convex Analysis
• Combining The Proximal Algorithm And Tikhonov Regularization
• Singularities and the distribution of density in the Burgers/adhesion model
• Growth conditions and \(U\)-Lagrangians