# On the convexity of piecewise-defined functions

@inproceedings{Bauschke2014OnTC, title={On the convexity of piecewise-defined functions}, author={Heinz H. Bauschke and Yves Lucet and Hung Minh Phan}, year={2014} }

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.

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Citations

##### Publications citing this paper.

SHOWING 1-7 OF 7 CITATIONS

## Minimum polyhedron with $n$ vertices.

VIEW 7 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## A Moving-window penalization method and its applications

VIEW 5 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## CHARACTERIZING AND TESTING SUBDIFFERENTIAL REGULARITY FOR PIECEWISE SMOOTH OBJECTIVE FUNCTIONS

VIEW 1 EXCERPT

CITES BACKGROUND

## Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 14 REFERENCES

## An easy path to convex analysis and applications

VIEW 1 EXCERPT

## Convex Analysis in General Vector Spaces

VIEW 1 EXCERPT