A quadratic programming algorithm for large and sparse problems
Miroslav Tůma (1991)
Kybernetika
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “An algorithm for indefinite quadratic programming based on a partial Cholesky factorization”
A quadratic programming algorithm for large and sparse problems
A compact variable metric algorithm for linearly constrained nonlinear minimax approximation
Ladislav Lukšan (1985)
Kybernetika
Similarity:
Parametric integer programming
Paul Feautrier (1988)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The design and application of IPMLO. A FORTRAN library for linear optimization with interior point methods
J. Gondzio, D. Tachat (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
Thaï Quynh Phong, Le Thi Hoai An, Pham Dinh Tao (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation
Ladislav Lukšan (1984)
Kybernetika
Similarity: