na13

swMATH11509MaRDI QIDQ23450FDOQ23450

Author name not available (Why is that?)

Described by source

• Faster than the fast Legendre transform, the linear-time Legendre transform

Cited In (29)

• Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms
• Fast value iteration: an application of Legendre-Fenchel duality to a class of deterministic dynamic programming problems in discrete time
• A Modified Split Bregman Algorithm for Computing Microstructures Through Young Measures
• A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation
• Techniques and Open Questions in Computational Convex Analysis
• Graph-Matrix Calculus for Computational Convex Analysis
• Self-Dual Smooth Approximations of Convex Functions via the Proximal Average
• A comparative study on the convergence rate of some iteration methods involving contractive mappings
• Relaxation models of phase transition flows
• Numerical methods for anisotropic mean curvature flow based on a discrete time variational formulation
• Symbolic computation with monotone operators
• Minimax estimation of smooth optimal transport maps
• On numerical approximation of the Hamilton-Jacobi-transport system arising in high frequency approximations
• The back-and-forth method for Wasserstein gradient flows
• New formulas for the Legendre-Fenchel transform.
• A fast approach to optimal transport: the back-and-forth method
• PRESSURE LAWS AND FAST LEGENDRE TRANSFORM
• Computing the conjugate of convex piecewise linear-quadratic bivariate functions
• Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis
• Convexity of the proximal average
• The piecewise linear-quadratic model for computational convex analysis
• Fast Moreau envelope computation I: Numerical algorithms
• Symbolic Fenchel conjugation
• Computation of the epsilon-subdifferential of convex piecewise linear-quadratic functions in optimal worst-case time
• Fast weak–KAM integrators for separable Hamiltonian systems
• Linear-Time Convexity Test for Low-Order Piecewise Polynomials
• COMPUTING THE CONVEX ENVELOPE USING A NONLINEAR PARTIAL DIFFERENTIAL EQUATION
• Duality and Convex Programming
• Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions

This page was built for software: na13