Fast Moreau envelope computation I: Numerical algorithms
From MaRDI portal
Recommendations
- Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis
- A fast computational algorithm for the Legendre-Fenchel transform
- Faster than the fast Legendre transform, the linear-time Legendre transform
- Fast envelope algorithms
- A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation
Cites work
- scientific article; zbMATH DE number 4092631 (Why is no real title available?)
- scientific article; zbMATH DE number 3678487 (Why is no real title available?)
- scientific article; zbMATH DE number 1306982 (Why is no real title available?)
- scientific article; zbMATH DE number 687723 (Why is no real title available?)
- scientific article; zbMATH DE number 1014811 (Why is no real title available?)
- scientific article; zbMATH DE number 1568991 (Why is no real title available?)
- scientific article; zbMATH DE number 823375 (Why is no real title available?)
- scientific article; zbMATH DE number 2201295 (Why is no real title available?)
- scientific article; zbMATH DE number 3187170 (Why is no real title available?)
- A Convergence Theory for Saddle Functions
- A Moreau-Yosida regularization of a difference of two convex functions
- A Variable Metric Proximal Point Algorithm for Monotone Operators
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A family of variable metric proximal methods
- A fast Legendre transform algorithm and applications to the adhesion model
- A fast computational algorithm for the Legendre-Fenchel transform
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- A quasi-second-order proximal bundle algorithm
- Combining The Proximal Algorithm And Tikhonov Regularization
- Convergence analysis of a proximal newton method1
- Convex Analysis
- Coupling proximal methods and variational convergence
- Coupling the proximal point algorithm with approximation methods
- Distance transforms of sampled functions
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Entropy-Like Proximal Methods in Convex Programming
- Fast Legendre–Fenchel Transform and Applications to Hamilton–Jacobi Equations and Conservation Laws
- Fast Moreau envelope computation I: Numerical algorithms
- Faster than the fast Legendre transform, the linear-time Legendre transform
- Generalized Hessian Properties of Regularized Nonsmooth Functions
- Growth conditions and \(U\)-Lagrangians
- Kicked Burgers turbulence
- Lipschitz $r$-continuity of the approximative subdifferential of a convex function.
- Monotone Operators and the Proximal Point Algorithm
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs
- On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On the decay of Burgers turbulence
- On the relation between \(\mathcal U\)-Hessians and second-order epi-derivatives
- On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
- Piecewise smoothness for Moreau-Yosida approximation to a piecewise \(C^2\) convex function
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- Properties of the Moreau-Yosida regularization of a piecewise \(C^2\) convex function
- Prox-regular functions in Hilbert spaces
- Prox-regular functions in variational analysis
- Prox-regularity of functions and sets in Banach spaces
- Proximité et dualité dans un espace hilbertien
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- Second-order analysis of the Moreau-Yosida regularization
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Singularities and the distribution of density in the Burgers/adhesion model
- Submonotone mappings and the proximal point algorithm
- The decay of multiscale signals -- a deterministic model of Burgers turbulence
- The inviscid Burgers equation with initial data of Brownian type
- The 𝒰-Lagrangian of a convex function
- Uniform prox-regularity of functions and epigraphs in Hilbert spaces
- Variable metric bundle methods: From conceptual to implementable forms
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
Cited in
(22)- Polar convolution
- A note on fast envelope estimation
- Fast Moreau envelope computation I: Numerical algorithms
- A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions
- Envelope computation in the plane by approximate implicitization
- Computation of the epsilon-subdifferential of convex piecewise linear-quadratic functions in optimal worst-case time
- Techniques and open questions in computational convex analysis
- Compensated convex-based transforms for image processing and shape interrogation
- Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis
- Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions
- Convexity of the proximal average
- Computing the conjugate of convex piecewise linear-quadratic bivariate functions
- Explicit formulas for \(C^{1,1}\) Glaeser-Whitney extensions of \(1\)-Taylor fields in Hilbert spaces
- A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
- Compensated convexity on bounded domains, mixed Moreau envelopes and computational methods
- A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation
- Fast envelope algorithms
- Duality and Convex Programming
- The piecewise linear-quadratic model for computational convex analysis
- A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions
- Graph-matrix calculus for computational convex analysis
- Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
This page was built for publication: Fast Moreau envelope computation I: Numerical algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870763)
