On the convexity of piecewise-defined functions
From MaRDI portal
(Redirected from Publication:2994670)
Abstract: Functions that are piecewise defined are a common sight in mathematics while convexity is a property especially desired in optimization. Suppose now a piecewise-defined function is convex on each of its defining components - when can we conclude that the entire function is convex? In this paper we provide several convenient, verifiable conditions guaranteeing convexity (or the lack thereof). Several examples are presented to illustrate our results.
Recommendations
- A sufficient minimality condition for convex composite functions
- Mordukhovich subdifferential of pointwise minimum of approximate convex functions
- Piecewise-convex maximization problems.
- Piecewise-convex maximization problems: algorithm and computational experiments
- Levels sets infimal convolution and level addition
Cites work
- A simple proof of the Jensen-type inequality of Fink and Jodeit
- An easy path to convex analysis and applications
- Classical and strong convexity of sublevel sets and application to attainable sets of nonlinear systems
- Computing the conjugate of convex piecewise linear-quadratic bivariate functions
- Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Convexity preserving \(C^0\) splines
- Convexity preserving interpolation
- Convexity preserving splines over triangulations
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- On convexity of piecewise polynomial functions on triangulations
- On the structure of convex piecewise quadratic functions
- Relative convexity and its applications
- Techniques and open questions in computational convex analysis
- The convex envelope is the solution of a nonlinear obstacle problem
- What shape is your conjugate? A survey of computational convex analysis and its applications
Cited in
(19)- Piecewise constant roughly convex functions
- Ordering of sets, hyperbolic metrics, and harmonic measures
- An adaptive alternating direction method of multipliers
- Minimum polyhedron with \(n\) vertices
- Union averaged operators with applications to proximal algorithms for MIN-convex functions
- Finitely determined functions
- Calculating the derivative of piecewise functions
- On discrete Hessian matrix and convex extensibility
- A few questions on the support function of the discussion in the teaching of convex analysis
- Convex and V-shaped sequences of sums of functions that depend on ceiling functions
- On directions of strictness, affinity and constancy and the minimum set of a proper convex function
- scientific article; zbMATH DE number 2051797 (Why is no real title available?)
- A sufficient minimality condition for convex composite functions
- Characterizing and testing subdifferential regularity in piecewise smooth optimization
- scientific article; zbMATH DE number 5499036 (Why is no real title available?)
- On the properties of convex functions over open sets
- Linear-time convexity test for low-order piecewise polynomials
- Convexity in ReLU neural networks: beyond ICNNs?
- Closest univariate convex linear-quadratic function approximation with minimal number of pieces
This page was built for publication: On the convexity of piecewise-defined functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2994670)
