na13

swMATH11509MaRDI QIDQ23450

No author found.

Described by source

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

Related Items (29)

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

This page was built for software: na13