Skip to search formSkip to main contentSkip to account menu

Proper convex function

Known as: Proper concave function, Proper convex 
In mathematical analysis (in particular convex analysis) and optimization, a proper convex function is a convex function f taking values in the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
We study the problem of estimating high-dimensional regression models regularized by a structured sparsity-inducing penalty that… 
Highly Cited
2012
Highly Cited
2012
Splitting methods have recently received much attention due to the fact that many nonlinear problems arising in applied areas… 
Highly Cited
2009
Highly Cited
2009
The unified theory of near-field–far-field transformations with spiral scannings for quasi-spherical antennas is extended in this… 
Highly Cited
2005
Highly Cited
2005
Abstract The DC programming and its DC algorithm (DCA) address the problem of minimizing a function f=g−h (with g,h being lower… 
Highly Cited
2002
Highly Cited
2002
I propose a common framework that combines three different paradigms in machine learning: generative, discriminative and… 
Highly Cited
2000
Highly Cited
1996
Highly Cited
1976
Highly Cited
1976
For the problem of minimizing a lower semicontinuous proper convex function f on a Hilbert space, the proximal point algorithm in… 
Highly Cited
1966
Highly Cited
1966
Each lower semi-continuous proper convex function / on a Banach space E defines a certain multivalued mapping df from E to E… 
Highly Cited
1966
Highly Cited
1966
A finite-valued convex function on a nonempty convex set C in F can always be extended to a proper convex function on F by…