Active-set method
An optimization problem is defined using an objective function to minimize or maximize, and a set of constraints that define the feasible region, that is, the set of all x to search for the optimal solution.in the feasible region, a constraint is called active atthat are active at the current point (Nocedal & Wright 2006, p. 308).For example, in solving the linear programming problem, the active set gives the hyperplanes that intersect at the solution point.In quadratic programming, as the solution is not necessarily on one of the edges of the bounding polygon, an estimation of the active set gives us a subset of inequalities to watch while searching the solution, which reduces the complexity of the search.In general an active-set algorithm has the following structure: Methods that can be described as active-set methods include:[1] Consider the problem of Linearly Constrained Convex Quadratic Programming.Under reasonable assumptions (the problem is feasible, the system of constraints is regular at every point, and the quadratic objective is strongly convex), the active-set method terminates after finitely many steps, and yields a global solution to the problem.