2026-08-28·by Sijie Wang#node#optimization#math

optimization

Optimization (traditional → modern)

You know the classical math core: formulate a model → minimize f(x) s.t. constraints → take the Lagrangian, multipliers μ/λ, KKT. This is the map of the whole field around that core, by era, with why each era exists.

The through-line (why it kept evolving)

Optimization grew every time the problem broke an assumption of the previous era:

  1. classical — small, smooth, convex → solvable exactly (∇=0, KKT, duality).
  2. numerical — too big for closed form → iterate (descend, Newton, split).
  3. stochastic / ML — huge + non-convex + noisy gradients → SGD.
  4. discrete / global — no gradient, combinatorial, many minima → search.
  5. sequential / control — optimize over time / under uncertaintyDP, Bellman, control, online.
  6. modern frontier — the objective itself is learned / adversarial / nested → bilevel, minimax, OT, learn-to-optimize.

The six clusters

  • classical-optimization — the math you know + convex optimization (the tractable core; convexity = the dividing line).
  • numerical-methods — how you actually solve: first/second-order, constrained solvers, line-search / trust regions, the gradient-flow ODE view.
  • stochastic-and-ml-optimization — Robbins–Monro → SGD/Adam; non-convex deep-learning landscapes.
  • discrete-and-global-optimization — integer/combinatorial (branch-and-bound, SAT/CDCL), metaheuristics (annealing, evolutionary), Bayesian / black-box.
  • sequential-and-controlDP / Bellman, optimal control (Pontryagin / HJB), RL, online learning (regret, bandits).
  • modern-frontierbilevel / meta, minimax / games, optimal transport, learn-to-optimize, continuation / curriculum.

Why this connects to the cybernetics thread

This is the field our recursive-harness lives in:

optimization