Revision as of 11:04, 14 February 2014 edit Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits m Qwertyus moved page Active set to Active set method over redirect ← Previous edit		Revision as of 22:33, 15 February 2014 edit undo 174.53.163.11 (talk) →Active set methods Next edit →
Line 21: ::''search'' for infeasible constraints :'''end repeat''' Methods that can be described as '''active set methods''' include{{Citation needed\|date=November 2013}}: Line 28 ⟶ 27: * [[Sequential linear-quadratic programming]] (SLQP) <!-- acc. to: Leyffer... - alt: acc. to "MPS glossary", http://glossary.computing.society.informs.org/ver2/mpgwiki/index.php/Main_Page: Successive approximation --> * [[Frank–Wolfe algorithm\|Reduced gradient method]] (RG) <!-- acc. to: MPS glossary, http://glossary.computing.society.informs.org/ver2/mpgwiki/index.php/Main_Page - alt: acc. to "Optimization - Theory and Practice" (Forst, Hoffmann): Projection method --> * [[Generalized Reduced Gradient\|Generalized ~~Reduced~~reduced ~~Gradient~~gradient method]] (GRG) <!-- acc. to: MPS glossary, http://glossary.computing.society.informs.org/ver2/mpgwiki/index.php/Main_Page - alt: acc. to "Optimization - Theory and Practice" (Forst, Hoffmann): Projection method --> <!-- ? Wilson's Lagrange-newton method --> <!-- ? Method of feasible directions (MFD) -->

Active-set method: Difference between revisions