Abstract
The generalized mean function has been widely used in convex analysis and mathematical programming. This paper studies a further generalization of such a function. A necessary and sufficient condition is obtained for the convexity of a generalized function. Additional sufficient conditions that can be easily checked are derived for the purpose of identifying some classes of functions which guarantee the convexity of the generalized functions. We show that some new classes of convex functions with certain regularity (such as S*-regularity) can be used as building blocks to construct such generalized functions.
| Original language | English |
|---|---|
| Pages (from-to) | 37-51 |
| Journal | SIAM Journal on Optimization |
| Volume | 17 |
| Issue number | 1 |
| Online published | 28 Jul 2006 |
| DOIs | |
| Publication status | Published - 2007 |
| Externally published | Yes |
Research Keywords
- Convexity
- Generalized mean function
- Mathematical programming
- S*-regular functions
- Self-concordant functions
Fingerprint
Dive into the research topics of 'Constructing generalized mean functions using convex functions with regularity conditions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver