The piecewise linear-quadratic model for computational convex analysis
DOI10.1007/s10589-007-9124-yzbMath1186.90089OpenAlexW2133898219MaRDI QIDQ842774
Heinz H. Bauschke, Yves Lucet, Mike Trienis
Publication date: 25 September 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.318.5177
convex analysisLegendre-Fenchel transformMoreau envelopeMoreau-Yosida approximateFenchel conjugatecomputational convex analysisproximal average
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Algorithms for approximation of functions (65D15)
Related Items (13)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast Moreau envelope computation I: Numerical algorithms
- Symbolic Fenchel conjugation
- The inviscid Burgers equation with initial data of Brownian type
- Faster than the fast Legendre transform, the linear-time Legendre transform
- Projection and proximal point methods: Convergence results and counterexamples.
- A fast Legendre transform algorithm and applications to the adhesion model
- A fast computational algorithm for the Legendre-Fenchel transform
- Lipschitz $r$-continuity of the approximative subdifferential of a convex function.
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- A new proximal point iteration that converges weakly but not in norm
- Fast Legendre–Fenchel Transform and Applications to Hamilton–Jacobi Equations and Conservation Laws
- On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions
- Symbolic computation of Fenchel conjugates
- How to Transform One Convex Function Continuously into Another
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
This page was built for publication: The piecewise linear-quadratic model for computational convex analysis