 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Convex Analysis
edit- Convex analysis
- Characteristic function (convex analysis)
- Closed convex function
- Convex cone
- Convex conjugate
- Convex function
- Convex optimization
- Danskin's theorem
- Dual cone and polar cone
- Ekeland's variational principle
- Epigraph (mathematics)
- Farkas' lemma
- Fenchel's duality theorem
- Gauss–Lucas theorem
- Hilbert projection theorem
- Invex function
- Kachurovskii's theorem
- Karamata's inequality
- Legendre transformation
- Linear programming
- Linear separability
- Minkowski functional
- Modulus and characteristic of convexity
- Moreau's theorem
- Polyconvex function
- Popoviciu's inequality
- Proper convex function
- Pseudoconvex function
- R. Tyrrell Rockafellar
- Schur-convex function
- Shephard's problem
- Strictly convex space
- Subderivative
- Tonelli's theorem (functional analysis)
- Uniformly convex space
- Barrier function
- Conic optimization
- Dual problem
- Entropy maximization
- Geodesic convexity
- Lagrangian relaxation
- Linear-fractional programming
- Subgradient method