Startseite A polynomial algorithm for the quadratic programming problem
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

A polynomial algorithm for the quadratic programming problem

  • Valentin A. Bereznev
Veröffentlicht/Copyright: 28. Mai 2014

Abstract

An approach based on projection of a vector onto a pointed convex polyhedral cone is proposed for solving the quadratic programming problem with a positive definite matrix of the quadratic form. It is proved that this method has polynomial complexity. A method is said to be of polynomial computational complexity if the solution to the problem can be obtained in N1 = O(nα) elementary operations, where α is some positive number, in contrast with a method of exponential computational complexity whose implementation requires N2 = exp(O(n)) operations.

Published Online: 2014-5-28
Published in Print: 2014-6-1

© 2014 by Walter de Gruyter Berlin/Boston

Heruntergeladen am 3.12.2025 von https://www.degruyterbrill.com/document/doi/10.1515/rnam-2014-0011/pdf
Button zum nach oben scrollen