Algebraic Solution of the Problems of Nonconvex Quadratic Programming

Authors:
O. V. Khamisov
Affiliations:
Melentiev Energy Systems Institute, Siberian Branch, Russian Academy of Sciences, Irkutsk, Russia
Venue:
Automation and Remote Control
Year:
2004

Citing 4
Cited 0

Lectures on modern convex optimization: analysis, algorithms, and engineering applications

Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems

Proceedings of the 19th IFIP TC7 Conference on System Modelling and Optimization: Methods, Theory and Applications
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Introduction to Global Optimization (Nonconvex Optimization and Its Applications)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.