Convexity
One word, taught differently in 2 fields. Each use is given apart.
In Mathematics
A property of functions and sets where optimization problems have a unique global minimum and nice theoretical guarantees.
In Economics
A measure of the curvature in the relationship between bond prices and bond yields that helps measure portfolio risk.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
In Mathematics
2Each in their own terms, from the easiest level.
Julian Chaidez
A property of a hypersurface in a contact manifold that is transverse to a contact vector field.
In Economics
1Andrew Lo
Lectures that assume it
33The first 12 are shown.
- Convex Optimization Problems — LP, QP, SOCP & SDP
- Statistical Estimation
- The Lagrangian, Dual Function & Slater's Condition
- Geometric Interpretation of Duality, Sensitivity & Theorems of Alternatives
- Convex Optimization with Abstract Linear Operators
- Linear-size ℓ₁ Sparsifiers
- Positive Definite and Semidefinite Matrices
- Unconstrained Minimization
- Equality Constrained Minimization
- Subgradients: Subdifferential Calculus & Optimality Conditions
- Convex Functions — First/Second-Order Conditions & Epigraphs
- Saddle-Point Interpretation, KKT Conditions & Perturbation
Connections
42The lectures that define it or assume it, and the concepts next to it.
Concepts5
Lectures37
- Convex Hypersurfaces and Robust Heterodimensional Dynamics
- Fixed-Income Securities IV
- Minimizing a Function Step by Step
- Fixed-Income Securities III
- Convex Optimization Problems — LP, QP, SOCP & SDP
- Statistical Estimation
Show 31 moreShow fewer
- The Lagrangian, Dual Function & Slater's Condition
- Geometric Interpretation of Duality, Sensitivity & Theorems of Alternatives
- Convex Optimization with Abstract Linear Operators
- Linear-size ℓ₁ Sparsifiers
- Positive Definite and Semidefinite Matrices
- Unconstrained Minimization
- Equality Constrained Minimization
- Subgradients: Subdifferential Calculus & Optimality Conditions
- Convex Functions — First/Second-Order Conditions & Epigraphs
- Saddle-Point Interpretation, KKT Conditions & Perturbation
- Antifragile: Convexity, Optionality, and Systems That Gain from Disorder
- Mathematical Optimization & Why Convexity Is the Watershed
- Advanced Topics and Applications
- Subgradient Methods: Step-Size Rules, Convergence & Polyak Steps
- Subgradient Methods for Constrained Problems
- Convex Optimization II: Sequential Convex Programming and Conjugate Gradient Methods
- Convex Optimization II: Conjugate Gradient and Truncated Newton Methods
- Gradient Descent: Downhill to a Minimum
- Stochastic Gradient Descent
- Liquid Vector Spaces and Condensed Mathematics
- Norms of Vectors and Matrices
- A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies
- Aubry-Mather Theory, Complete Devil Stair Case and Fractional Quantum Hall Effects
- Duality Theory
- Approximation and Fitting
- Subgradients II: Directional Derivatives, Cutting Planes & Quasiconvexity
- Trajectory Optimization I
- Mixed-discrete (combinatorial) and continuous optimization
- Collapsing of Polygons
- Introduction to Large Deviation Theory
- From Monge Transportation to Einstein's Gravitation via Eulerian Approach