Convex optimization
Convex optimization is the minimization or maximization of a convex or concave objective over a convex feasible set, a structure that permits global optimality guarantees.
Build a Robo-Advisor with Python (From Scratch)
Optimization with a convex objective function and a convex feasible set, for which efficient algorithms can provide globally optimal solutions.
- How it is used
- Constructs portfolio allocations and other automated financial decisions with reliable optimization formulations.
- How deep it goes
- Defines convex objectives and feasible sets, explains gradient optimality, and derives a risk-parity objective.
- Examples
- Uses a bounded quadratic and a three-asset covariance-matrix risk-parity portfolio.
- What you can do after
- Apply it via CVXPY to formulate and solve convex portfolio optimization problems.
Read how Build a Robo-Advisor with Python (From Scratch) explains convex optimization →
Timeless Algorithms, The Foundational Ideas
Convex optimization is optimization in which the objective and feasible region have convex structure, allowing local optima to be global optima under standard conditions.
- How it is used
- Uses convex optimization to select a maximum-margin decision boundary for a linearly separable SVM training set.
- How deep it goes
- Formulates the hard-margin objective and linear constraints, explains global optimality and support vectors, then points to soft margins for nonseparable data.
- Examples
- Uses the hard-margin SVM objective, its separation constraints, and margin-boundary support vectors as the concrete example.
- What you can do after
- Understand how convexity and linear constraints yield a globally optimal maximum-margin separator when training data is linearly separable.
Read how Timeless Algorithms, The Foundational Ideas explains convex optimization →
What to know first
- objective functionAn objective function is a mathematical function that assigns values to candidate solutions or parameter settings, which an optimization procedure seeks to minimize or maximize.
Related concepts
- optimizationkind of · Optimization is the systematic selection or modification of values, configurations, or implementations to improve a defined objective, often subject to constraints.
- support vector machineused by · A support vector machine is a supervised-learning model that uses support vectors to define a maximum-margin decision boundary or regression function, with kernels enabling nonlinear relationships.
- cvxpyaddressed by · CVXPY is a Python library for modeling and solving convex optimization problems with a declarative mathematical syntax.
- risk parityused by · Risk parity is a portfolio-construction technique that allocates weights so that selected assets or asset classes contribute equally, or according to specified proportions, to portfolio risk.
- portfolio optimizationuses · Portfolio optimization is the process of selecting investment holdings or weights to optimize specified objectives, such as balancing expected return and risk, subject to constraints.
- decision functionproduces · A decision function is a rule that maps an observation's features to a numerical value whose sign or threshold determines the predicted class.
Questions about convex optimization
What is convex optimization?
Convex optimization is the minimization or maximization of a convex or concave objective over a convex feasible set, a structure that permits global optimality guarantees.
Which Manning books explain convex optimization?
Build a Robo-Advisor with Python (From Scratch) and Timeless Algorithms, The Foundational Ideas.
What should I know before learning convex optimization?
Manning books that teach convex optimization usually introduce objective function first.
What is convex optimization a kind of?
Convex optimization is a kind of optimization. Optimization is the systematic selection or modification of values, configurations, or implementations to improve a defined objective, often subject to constraints.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.

