A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions
From MaRDI portal
Publication:1639725
DOI10.1007/s10589-018-0007-1zbMath1419.90106OpenAlexW2802936684MaRDI QIDQ1639725
Publication date: 13 June 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2429/71038
convex functionsubdifferentialLegendre-Fenchel transformcomputer-aided convex analysisconjugatepiecewise linear-quadratic functionscomputational convex analysis (CCA)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the conjugate of convex piecewise linear-quadratic bivariate functions
- Legendre transform and applications to finite and infinite optimization
- Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis
- Convex parametric piecewise quadratic optimization: theory and algorithms
- Fast Moreau envelope computation I: Numerical algorithms
- A fast computational algorithm for the Legendre-Fenchel transform
- Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions
- Strongly Convex Functions, Moreau Envelopes, and the Generic Nature of Convex Functions with Strong Minimizers
- Graph-Matrix Calculus for Computational Convex Analysis
- What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications
- Variational Analysis
- Convex Analysis
- Techniques and Open Questions in Computational Convex Analysis