Live briefing
Everything about Proper convex function
Concept in convex analysis
In mathematical analysis, in particular the subfields of convex analysis and optimization, a proper convex function is an extended real-valued convex function with a non-empty domain, that never takes on the value and also is not identically equal to Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Proper convex functionA 5-minute orientation
- Pick up a classic book: PTAexamThe most-reprinted book on the subject
- Read the landmark paper: Proper bayes minimax estimators for a multivariate normal mean with unknown common variance under a convex loss functionCited 4 times
- Go sideways: Effective domainA closely related topic
- Go sideways: Hypograph (mathematics)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
PTAexamScott M. Giles · 2010
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Effective domain In convex analysis, a branch of mathematics, the effective domain extends of the domain of a function defined for functions that take values in the extended…
- Hypograph (mathematics) In mathematics, the hypograph or subgraph of a function f : R n → R {\displaystyle f:\mathbb {R} ^{n}\rightarrow \mathbb {R} } is the set of points lying…
- Fenchel's duality theorem In mathematics, Fenchel's duality theorem is a result in the theory of convex functions named after Werner Fenchel. Let f {\displaystyle f} be a proper…
- Epigraph (mathematics) In mathematics, the epigraph or supergraph of a function f : X → [ − ∞ , ∞ ] {\displaystyle f:X\to [-\infty ,\infty ]} valued in the extended real numbers…
- Subderivative In mathematics, the subderivative (or subgradient) generalizes the derivative to convex functions which are not necessarily differentiable. The set of…
- Duality (optimization) In mathematical optimization theory, duality or the duality principle is the principle that optimization problems may be viewed from either of two perspectives…
- Perturbation function In mathematical optimization, the perturbation function is any function which relates to primal and dual problems. The name comes from the fact that any…
- Arg max In mathematics, the arguments of the maxima (abbreviated arg max or argmax) and arguments of the minima (abbreviated arg min or argmin) are the input points…