Skip to search formSkip to main contentSkip to account menu

Closed convex function

In mathematics, a function is said to be closed if for each , the sublevel set is a closed set. Equivalently, if the epigraph defined by is closed… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations

Broader (1)

Convex analysis
Convex conjugateConvex functionEpigraph (mathematics)Proper convex function

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Accelerated Mirror Descent In Continuous and Discrete Time Supplementary material , NIPS 2015
1 Mirror operator ∇ψ * In this section, we discuss properties of distance generating functions and their subdif-ferentials. Let… 
2013
2013
An Algorithm Using Moreau-Yosida Regularization for Minimization of a Nondifferentiable Convex Function
In this paper we present an algorithm for minimization of a nondifferentiable proper closed convex function. Using the second… 
2012
2012
Nondifferentiable Convex Optimization : An Algorithm Using Moreau-Yosida Regularization
In this paper we present an algorithm for minimization of a nondifferentiable proper closed convex function. Using the second… 
2011
2011
CLOSED MEANS CONTINUOUS IFF POLYHEDRAL: A CONVERSE OF THE GKR THEOREM
Given x, a point of a convex subset C of an Euclidean space, the two following statements are proven to be equivalent: (i) any… 
2005
2005
Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization
In order to minimize a closed convex function that is approximated by a sequence of better behaved functions, we investigate the… 
Review
1998
Review
1998
Interior Point Methods for Nondiierentiable Optimization
We describe the analytic center cutting plane method and its relationship to classical methods of nondi erentiable optimization… 
1998
1998
Generalized Bundle Methods * Antonio Frangioni †
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)