Pages that link to "Item:Q1385149"
From MaRDI portal
The following pages link to Faster than the fast Legendre transform, the linear-time Legendre transform (Q1385149):
Displaying 33 items.
- na13 (Q23450) (← links)
- A comparative study on the convergence rate of some iteration methods involving contractive mappings (Q288312) (← links)
- Computing the conjugate of convex piecewise linear-quadratic bivariate functions (Q353145) (← links)
- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms (Q607786) (← links)
- Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis (Q618886) (← links)
- Convexity of the proximal average (Q630022) (← links)
- The piecewise linear-quadratic model for computational convex analysis (Q842774) (← links)
- Fast Moreau envelope computation I: Numerical algorithms (Q870763) (← links)
- Symbolic Fenchel conjugation (Q959925) (← links)
- New formulas for the Legendre-Fenchel transform. (Q1419731) (← links)
- Symbolic computation with monotone operators (Q1653328) (← links)
- Minimax estimation of smooth optimal transport maps (Q2039809) (← links)
- A fast approach to optimal transport: the back-and-forth method (Q2209529) (← links)
- Computation of the epsilon-subdifferential of convex piecewise linear-quadratic functions in optimal worst-case time (Q2328199) (← links)
- On numerical approximation of the Hamilton-Jacobi-transport system arising in high frequency approximations (Q2438869) (← links)
- Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions (Q2450909) (← links)
- A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation (Q2515072) (← links)
- Duality and Convex Programming (Q2789804) (← links)
- Self-Dual Smooth Approximations of Convex Functions via the Proximal Average (Q2897273) (← links)
- Graph-Matrix Calculus for Computational Convex Analysis (Q2897284) (← links)
- PRESSURE LAWS AND FAST LEGENDRE TRANSFORM (Q3004772) (← links)
- Relaxation models of phase transition flows (Q3428052) (← links)
- Fast weak–KAM integrators for separable Hamiltonian systems (Q3450032) (← links)
- COMPUTING THE CONVEX ENVELOPE USING A NONLINEAR PARTIAL DIFFERENTIAL EQUATION (Q3520456) (← links)
- Fast value iteration: an application of Legendre-Fenchel duality to a class of deterministic dynamic programming problems in discrete time (Q4960138) (← links)
- A Modified Split Bregman Algorithm for Computing Microstructures Through Young Measures (Q4992263) (← links)
- The back-and-forth method for Wasserstein gradient flows (Q4999527) (← links)
- Global optimization via <i>α</i>‐dense curves (Q5695206) (← links)
- Techniques and Open Questions in Computational Convex Analysis (Q5746453) (← links)
- Linear-Time Convexity Test for Low-Order Piecewise Polynomials (Q5857296) (← links)
- Efficient and exact multimarginal optimal transport with pairwise costs (Q6571369) (← links)
- Compensated convex-based transforms for image processing and shape interrogation (Q6606496) (← links)
- Computational polyconvexification of isotropic functions (Q6644356) (← links)
