| Issue |
ESAIM: COCV
Volume 22, Number 3, July-September 2016
|
|
|---|---|---|
| Page(s) | 728 - 742 | |
| DOI | https://doi.org/10.1051/cocv/2015023 | |
| Published online | 27 April 2016 | |
On the convexity of piecewise-defined functions∗,∗∗,∗∗∗
1
Mathematics, University of British Columbia
Okanagan, Kelowna,
B.C. V1V 1V7,
Canada.
heinz.bauschke@ubc.ca
2
Computer Science, University of British Columbia
Okanagan, Kelowna,
B.C. V1V 1V7,
Canada.
yves.lucet@ubc.ca
3
Department of Mathematical Sciences, University of Massachusetts
Lowell, Lowell,
M.A.
01854,
USA.
hungphan@uml.edu
Received:
21
August
2014
Revised:
27
March
2015
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.
Mathematics Subject Classification: 26B25 / 52A41 / 65D17 / 90C25
Key words: Computer-aided convex analysis / convex function / convex interpolation / convex set / piecewise-defined function
© EDP Sciences, SMAI 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.