σμimplied vol · KKmax(S−K,0)udβρᵢⱼfat tailsPnL · drawdownyield · TdSₜ = μSₜ dt + σSₜ dWₜC = S·N(d₁) − K·e⁻ʳᵀ·N(d₂)σₚ² = wᵀΣwd₁ = [ln(S/K) + (r + σ²⁄2)T] ⁄ σ√T∂V/∂t + ½σ²S²·∂²V/∂S² + rS·∂V/∂S − rV = 0Sharpe = (Rₚ − R_f) ⁄ σₚVaR₉₉ = μ − 2.33σρ = Cov(X,Y) ⁄ σₓσᵧE[Rₚ] = Σ wᵢ·E[Rᵢ]φ(x) = e^(−x²/2) ⁄ √2πE[Rᵢ] = R_f + βᵢ(E[Rₘ] − R_f)dXₜ = θ(μ − Xₜ)dt + σ dWₜσ²ₜ = ω + α·ε²ₜ₋₁ + β·σ²ₜ₋₁C − P = S − K·e⁻ʳᵀΔ = ∂V/∂S Γ = ∂²V/∂S²p = (e^(rΔt) − d) ⁄ (u − d)rₜ = ln(Pₜ ⁄ Pₜ₋₁)E[Xₜ₊₁ | ℱₜ] = Xₜf* = (bp − q) ⁄ bz = (x − μ) ⁄ σP(N=k) = λᵏe^(−λ) ⁄ k!Θ = −∂V/∂Tν = S·φ(d₁)·√Tmin wᵀΣw s.t. wᵀμ = μ*∫Σ∂∞λ
uantCraft AcademyRoadmapsSkills
Ctrl K
AO
+1.2k Learners
LoginJoin ↗
RoadmapsSkills
AO
+1.2k Learners
Login
  • English
  • Français
  • Español
  • العربية
  • Português
  • Deutsch
  • 日本語
  • 中文
uantCraft Academy

Quant development, learned by doing: short lessons, graded labs and a real IDE, right in your browser.

Learn
All roadmapsAll skillsPython skillC++ skillSoonOxCaml skillSoonMarket Structure skillCalculus skillLinear Algebra skillProbability skillStatistics skillMatrix Decompositions skillOptimization skill
Support
Give us feedbackBuy us a Coffee
Legal
Privacy policyTerms of service
© 2026 QuantCraft Solutions. All rights reserved.
QuantCraft
σμimplied vol · KKmax(S−K,0)udβρᵢⱼfat tailsPnL · drawdownyield · TdSₜ = μSₜ dt + σSₜ dWₜC = S·N(d₁) − K·e⁻ʳᵀ·N(d₂)σₚ² = wᵀΣwd₁ = [ln(S/K) + (r + σ²⁄2)T] ⁄ σ√T∂V/∂t + ½σ²S²·∂²V/∂S² + rS·∂V/∂S − rV = 0Sharpe = (Rₚ − R_f) ⁄ σₚVaR₉₉ = μ − 2.33σρ = Cov(X,Y) ⁄ σₓσᵧE[Rₚ] = Σ wᵢ·E[Rᵢ]φ(x) = e^(−x²/2) ⁄ √2πE[Rᵢ] = R_f + βᵢ(E[Rₘ] − R_f)dXₜ = θ(μ − Xₜ)dt + σ dWₜσ²ₜ = ω + α·ε²ₜ₋₁ + β·σ²ₜ₋₁C − P = S − K·e⁻ʳᵀΔ = ∂V/∂S Γ = ∂²V/∂S²p = (e^(rΔt) − d) ⁄ (u − d)rₜ = ln(Pₜ ⁄ Pₜ₋₁)E[Xₜ₊₁ | ℱₜ] = Xₜf* = (bp − q) ⁄ bz = (x − μ) ⁄ σP(N=k) = λᵏe^(−λ) ⁄ k!Θ = −∂V/∂Tν = S·φ(d₁)·√Tmin wᵀΣw s.t. wᵀμ = μ*∫Σ∂∞λ
uantCraft AcademyRoadmapsSkills
Ctrl K
AO
+1.2k Learners
LoginJoin ↗
RoadmapsSkills
AO
+1.2k Learners
Login
  • English
  • Français
  • Español
  • العربية
  • Português
  • Deutsch
  • 日本語
  • 中文
Skills›Optimization
O

Optimization Skill

LiveStart here

Almost every quant model ends in an optimisation: a calibration that fits parameters, a regression that fits a line, a portfolio that picks weights. This skill shows what the solvers actually do, with short checks (numbers you compute, steps you order, concepts you match) and finance examples: why a step size that is too big makes gradient descent diverge, why Adam is the default for noisy objectives, why a convex problem has one answer, what a KKT multiplier prices, how an L1 penalty sets weights to exactly zero and how a linear program splits a large order over time. The capstone is a code lab where you write the projection and the solver yourself and test the result on real stock returns.

5 modules12 graded labs~11 hoursBeginner → Advanced
Start skill

Syllabus

12 topics · open any topic, in any order
  1. 1Objective functions gradients and minimaNot started40 minStart
  1. 2Gradient descentNot started50 minStart
  2. 3Stochastic gradient descent and mini-batchesNot started55 minStart
  3. 4Momentum RMSProp and AdamNot started55 minStart
  1. 5Convexity and why it mattersNot started50 minStart
  2. 6Newton and quasi-Newton methodsNot started55 minStart
  1. 7Constrained optimization and KKTNot started1 hrStart
  2. 8Mean-variance optimisationNot startedRequires Python55 minStart
  3. 9L1 and L2 regularisation as optimizationNot started50 minStart
  4. 10Linear programming for execution schedulesNot started55 minStart
  1. 11Non-convex pitfalls and restartsNot started50 minStart
  2. 12Capstone: constrained portfolio optimization with turnover and cost limitsNot started1 hr 40 minStart

Prerequisites

Calculus is expected (derivatives, gradients, the chain rule) and basic linear algebra (vectors, matrices, positive definiteness) helps.

  • CCalculus
  • LLinear Algebra

What you'll learn

  • Read an objective function through its gradient and Hessian and find and classify minima
  • Run gradient descent and its stochastic and adaptive variants (mini-batches, momentum, RMSProp, Adam) and choose step sizes that converge
  • Use convexity to know when a local minimum is the global one, and speed up with Newton and BFGS
  • Solve constrained problems with Lagrange multipliers and KKT conditions and read a multiplier as the price of a constraint
  • Treat L1 and L2 regularisation as optimization, and write execution schedules as linear programs
  • Spot the traps of non-convex problems, use restarts and build a constrained portfolio optimizer with turnover and cost limits on real returns

Tools you'll use

PythonNumPypandaspytest

Completion

Pass all 12 labs with a score of 70+ to complete the skill and earn the Optimization badge on your profile.

0 / 120%
uantCraft Academy

Quant development, learned by doing: short lessons, graded labs and a real IDE, right in your browser.

Learn
All roadmapsAll skillsPython skillC++ skillSoonOxCaml skillSoonMarket Structure skillCalculus skillLinear Algebra skillProbability skillStatistics skillMatrix Decompositions skillOptimization skill
Support
Give us feedbackBuy us a Coffee
Legal
Privacy policyTerms of service
© 2026 QuantCraft Solutions. All rights reserved.
QuantCraft
LoginJoin ↗
Login