On the locally polynomial complexity of the projection-gradient method for solving piecewise quadratic optimisation problems

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Prusińska, Agnieszka
dc.contributor.author Szkatuła, Krzysztof
dc.contributor.author Tret’yakov, Alexey
dc.date.accessioned 2021-06-16T13:17:29Z
dc.date.available 2021-06-16T13:17:29Z
dc.date.issued 2021
dc.identifier.citation Entropy. Vol. 23 (2021), no 4, art. no 465 pl
dc.identifier.issn 1099-4300
dc.identifier.uri http://hdl.handle.net/11331/3614
dc.identifier.uri https://doi.org/10.3390/e23040465
dc.description.abstract This paper proposes a method for solving optimisation problems involving piecewise quadratic functions. The method provides a solution in a finite number of iterations, and the computational complexity of the proposed method is locally polynomial of the problem dimension, i.e., if the initial point belongs to the sufficiently small neighbourhood of the solution set. Proposed method could be applied for solving large systems of linear inequalities en
dc.language.iso en pl
dc.rights Uznanie autorstwa 3.0 Polska *
dc.rights.uri http://creativecommons.org/licenses/by/3.0/pl/ *
dc.subject Gradient method pl
dc.subject Mathematical optimisation en
dc.subject Quadratic function en
dc.subject Metoda gradientu pl
dc.subject Optymalizacja matematyczna pl
dc.subject Funkcja kwadratowa pl
dc.title On the locally polynomial complexity of the projection-gradient method for solving piecewise quadratic optimisation problems en
dc.type Article pl


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record

Uznanie autorstwa 3.0 Polska Except where otherwise noted, this item's license is described as Uznanie autorstwa 3.0 Polska

Search DSpace


Advanced Search

Browse

My Account

Statistics