Faster than the fast Legendre transform, the linear-time Legendre transform
DOI10.1023/A:1019191114493zbMATH Open0909.65037OpenAlexW2407163532MaRDI QIDQ1385149FDOQ1385149
Authors: Yves Lucet 
Publication date: 23 June 1998
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019191114493
Recommendations
Numerical mathematical programming methods (65K05) Convex programming (90C25) Packaged methods for numerical algorithms (65Y15) Nonlinear programming (90C30) Computational aspects related to convexity (52B55)
Cited In (36)
- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms
- A fast Legendre transform algorithm and applications to the adhesion model
- Global optimization via α‐dense curves
- Fast value iteration: an application of Legendre-Fenchel duality to a class of deterministic dynamic programming problems in discrete time
- A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation
- Efficient and exact multimarginal optimal transport with pairwise costs
- Linear-time convexity test for low-order piecewise polynomials
- 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
- Compensated convex-based transforms for image processing and shape interrogation
- Pressure laws and fast Legendre transform
- Techniques and open questions in computational convex analysis
- Symbolic computation with monotone operators
- Stable calculation of the Legendre transform
- A modified split Bregman algorithm for computing microstructures through Young measures
- Minimax estimation of smooth optimal transport maps
- On numerical approximation of the Hamilton-Jacobi-transport system arising in high frequency approximations
- Fast weak-KAM integrators for separable Hamiltonian systems
- na13
- The back-and-forth method for Wasserstein gradient flows
- Computational polyconvexification of isotropic functions
- New formulas for the Legendre-Fenchel transform.
- A fast approach to optimal transport: the back-and-forth method
- 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
- Independent Nonlinear Component Analysis
- 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
- Graph-matrix calculus for computational convex analysis
Uses Software
This page was built for publication: Faster than the fast Legendre transform, the linear-time Legendre transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385149)
