Linked from

The 17 pages that link to Constrained optimization, each with the reason it gives.

• Partial derivativeRelated: Partial derivatives help identify stationary points and enforce constraints.

• RegularizationRelated: A feasible-set restriction is an alternative way to impose regularizing structure.

• Implicit function theoremRelated: Constraint equations often define feasible variables locally as functions of free variables.

• Comparative staticsRelated: Many economic equilibria are built from agents’ constrained choices.

• Heine–Borel theoremRelated: A closed bounded feasible region is compact, ensuring continuous objectives attain their extrema.

• Implicit differentiationRelated: Implicit derivatives can describe how a constraint links variables near an optimum.

• Numerical optimizationRelated: Many practical objectives are meaningful only within a feasible set.

• Sylvester's law of inertiaRelated: Second-order tests on constraint directions use inertia to distinguish local minima and maxima.

• Nonlinear least squaresRelated: Physical bounds and parameter relationships can constrain nonlinear fits.

• Function of several real variablesRelated: Many multivariable functions serve as objectives over constrained domains.

• Principle of minimum energyRelated: Fixed constraints restrict which states can compete for the minimum.

• Rational choice modelRelated: It expresses choice as maximizing an objective within the feasible options.