Active-set method: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
Alter: pages. Removed parameters. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | Category:CS1 maint: ref=harv | via #UCB_Category 988/2500
No edit summary
Line 1:
{{redirect|Active set|the band|The Active Set}}
 
In mathematical [[Optimization (mathematics)|optimization]], athe problem'''active-set ismethod''' defined usingis an objectivealgorithm functionused to minimizeidentify orthe maximize,active and[[Constraint (mathematics)|constraints]] in a set of [[Inequality (mathematics)|inequality]] constraints. The active constraints are then expressed as equality constraints, thereby transforming an inequality-constrained problem into a simpler equality-constrained subproblem.
 
An optimization problem is defined using an objective function to minimize or maximize, and a set of constraints
 
: <math>g_1(x) \ge 0, \dots, g_k(x) \ge 0</math>