Algebraic solution of the problems of nonconvex quadratic programming

Статья в журнале
Khamisov O.V.
Automation and Remote Control
Automation and Remote Control. Vol.65. No.2. P.218-226.
2004
An algebraic approach founded on the Gröbner bases coupled with the necessary optimality conditions of the first order was used to solve the problem of nonconvex quadratic programming. Illustrative numerical examples were presented.

Библиографическая ссылка

Khamisov O.V. Algebraic solution of the problems of nonconvex quadratic programming // Automation and Remote Control. Vol.65. No.2. 2004. P.218-226. DOI: 10.1023/B:AURC.0000014718.51686.38
Скопировать
WOS
SCOPUS
x
x