Faster than the fast Legendre transform, the linear-time Legendre transform
From MaRDI portal
Publication:1385149
DOI10.1023/A:1019191114493zbMath0909.65037OpenAlexW2407163532MaRDI QIDQ1385149
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
Numerical mathematical programming methods (65K05) Convex programming (90C25) Computational aspects related to convexity (52B55) Nonlinear programming (90C30) Packaged methods for numerical algorithms (65Y15)
Related Items
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, 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, Independent Nonlinear Component 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, Global optimization via α‐dense curves, 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, na13, 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
Uses Software
