A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints

Uložené v:

Podrobná bibliografia
Vydané v:	Numerische Mathematik Ročník 98; číslo 3; s. 539 - 558
Hlavní autori:	Zhang, J. Z., Liu, G. S., Wang, S. Y.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Heidelberg Springer 01.09.2004 Berlin New York, NY
Predmet:	Applied sciences Exact sciences and technology Mathematical programming Mathematics Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming Numerical methods in mathematical programming, optimization and calculus of variations Operational research and scientific management Operational research. Management science Sciences and techniques of general use Numerical analysis Algorithm performance Optimization method Linear complementarity problem Search algorithm Constrained optimization Mathematical programming
ISSN:	0029-599X, 0945-3245
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!