Visualization of the -subdifferential of piecewise linear-quadratic functions
From MaRDI portal
Publication:2013149
Abstract: Computing explicitly the {epsilon}-subdifferential of a proper function amounts to computing the level set of a convex function namely the conjugate minus a linear function. The resulting theoretical algorithm is applied to the the class of (convex univariate) piecewise linear-quadratic functions for which existing numerical libraries allow practical computations. We visualize the results in a primal, dual, and subdifferential views through several numerical examples. We also provide a visualization of the Br{o}ndsted-Rockafellar Theorem.
Recommendations
Cites work
- scientific article; zbMATH DE number 4098144 (Why is no real title available?)
- scientific article; zbMATH DE number 17710 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic programming
- A doubly stabilized bundle method for nonsmooth convex optimization
- A fast computational algorithm for the Legendre-Fenchel transform
- A redistributed proximal bundle method for nonconvex optimization
- Approximate Subdifferentials and Applications. I: The Finite Dimensional Theory
- Characterizations of convex approximate subdifferential calculus in Banach spaces
- Computing the conjugate of convex piecewise linear-quadratic bivariate functions
- Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions
- Convergence of some algorithms for convex minimization
- Convex Analysis
- Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis
- Generalized Bundle Methods
- Level bundle methods for oracles with on-demand accuracy
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On the Subdifferentiability of Convex Functions
- Piecewise linear quadratic optimal control
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Proximity control in bundle methods for convex nondifferentiable minimization
- Sparse/Robust Estimation and Kalman Smoothing with Nonsmooth Log-Concave Densities: Modeling, Computation, and Theory
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- The piecewise linear-quadratic model for computational convex analysis
- Thresholds of prox-boundedness of PLQ functions
- Variable metric bundle methods: From conceptual to implementable forms
- Variational Analysis
Cited in
(2)
This page was built for publication: Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013149)