A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm

A sequential quadratic programming (SQP) algorithm generating feasible iterates is described and analyzed. What distinguishes this algorithm from previous feasible SQP algorithms proposed by various authors is a reduction in the amount of computation required to generate a new iterate while the prop...

Celý popis

Podrobná bibliografia

Vydané v:	SIAM journal on optimization Ročník 11; číslo 4; s. 1092 - 1118
Hlavní autori:	Lawrence, Craig T., Tits, André L.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2001
Predmet:	Algorithms Lagrange multiplier Quadratic programming
ISSN:	1052-6234, 1095-7189
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!