Constrained optimization

Level UniversityDifficulty ★★★★★Concept⌖ Open in the map

What is it?

Minimize f(x)f(x) only over the points that satisfy constraints g(x)=0g(x) = 0 or h(x)≤0h(x) \le 0: a budget, a physical limit, a probability that must sum to 1. The minimum can now sit on the boundary, where ∇f≠0\nabla f \ne 0.

Formulas

min⁡xf(x)subject togi(x)=0,  hj(x)≤0\min_{x} f(x) \quad \text{subject to} \quad g_i(x) = 0,\ \ h_j(x) \le 0

Where it shows up in computing

  • Operations research and logistics★★★★★fundamentalOptimization and systems

    Scheduling, routing and allocation are optimization under capacity and demand constraints.

  • Trajectory optimization and MPC★★★★★fundamentalRobotics and control

    A robot trajectory minimizes effort subject to dynamics, joint limits and obstacles.

Where is it used?

Computing topics reachable from here, through the chain of ideas that leads to them:

What depends on it

This page has the essentials. A fuller treatment (intuition, formal definition, worked example) is on the way.

↑ ↓ to navigate · ↵ · Esc