{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T01:56:09Z","timestamp":1760234169794,"version":"build-2065373602"},"reference-count":18,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T00:00:00Z","timestamp":1618444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004569","name":"Ministerstwo Nauki i Szkolnictwa Wy\u017cszego","doi-asserted-by":"publisher","award":["61\/20\/B"],"award-info":[{"award-number":["61\/20\/B"]}],"id":[{"id":"10.13039\/501100004569","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/e23040465","type":"journal-article","created":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T12:11:00Z","timestamp":1618488660000},"page":"465","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Locally Polynomial Complexity of the Projection-Gradient Method for Solving Piecewise Quadratic Optimisation Problems"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6091-6884","authenticated-orcid":false,"given":"Agnieszka","family":"Prusi\u0144ska","sequence":"first","affiliation":[{"name":"Faculty of Exact and Natural Sciences, Siedlce University, 08-110 Siedlce, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0265-6033","authenticated-orcid":false,"given":"Krzysztof","family":"Szkatu\u0142a","sequence":"additional","affiliation":[{"name":"Faculty of Exact and Natural Sciences, Siedlce University, 08-110 Siedlce, Poland"},{"name":"Systems Research Institute, Polish Academy of Sciences, 01-447 Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3474-8458","authenticated-orcid":false,"given":"Alexey","family":"Tret\u2019yakov","sequence":"additional","affiliation":[{"name":"Faculty of Exact and Natural Sciences, Siedlce University, 08-110 Siedlce, Poland"},{"name":"Systems Research Institute, Polish Academy of Sciences, 01-447 Warsaw, Poland"},{"name":"Dorodnicyn Computing Centre of FRC CSC, Russian Academy of Sciences, 119333 Moscow, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,4,15]]},"reference":[{"key":"ref_1","unstructured":"Karmanov, V.G. (1989). Mathematical Programming, Mir Publishers."},{"key":"ref_2","first-page":"338","article-title":"Theorems of the alternative and their applications in numerical methods","volume":"43","author":"Golikov","year":"2003","journal-title":"Comput. Math. Math. Phys."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Evtushenko, Y.G., and Golikov, A. (2003). New perspective on the theorems of alternative. High Performance Algorithms and Software for Nonlinear Optimization, Springer.","DOI":"10.1007\/978-1-4613-0241-4_10"},{"key":"ref_4","first-page":"279","article-title":"A finite-termination gradient projection method for solving systems of linear inequalities","volume":"25","author":"Tretyakov","year":"2010","journal-title":"Russ. J. Numer. Anal. Model."},{"key":"ref_5","first-page":"121","article-title":"Exact differentiable penalty for a problem of quadratic programming with the use of a gradient-projective method","volume":"30","author":"Tretyakov","year":"2015","journal-title":"Russ. J. Numer. Anal. Model."},{"key":"ref_6","unstructured":"Han, S.-P. (1980). Least-Squares Solution of Linear Inequalities, Wisconsin Univ-Madison Mathematics Research Center. Technical Report."},{"key":"ref_7","first-page":"289","article-title":"A finite gradient-projective solver for a quadratic programming problem","volume":"28","author":"Tretyakov","year":"2013","journal-title":"Russ. J. Numer. Anal. Model."},{"key":"ref_8","unstructured":"Mangasarian, O. (2001). A Finite Newton Method for Classification Problems, Data Mining Institute, Computer Sciences Department, University of Wisconsin. Technical Report, Technical Report 01-11."},{"key":"ref_9","first-page":"14","article-title":"On the accurate identification of active constraints","volume":"9","author":"Facchinei","year":"1998","journal-title":"SIAM"},{"key":"ref_10","first-page":"673","article-title":"An algorithm for degenerate nonlinear programming with rapid local convergence","volume":"15","author":"Wright","year":"2005","journal-title":"SIAM"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0898-1221(99)00323-5","article-title":"A Projective Simplex Algorithm Using LU Decomposition","volume":"39","author":"Pan","year":"2000","journal-title":"Comput. Math. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1090\/S0273-0979-04-01040-7","article-title":"The interior-point revolution in optimization: History, recent developments, and lasting consequences","volume":"42","author":"Wright","year":"2005","journal-title":"Bull. Am. Math. Soc."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1080\/10556788.2017.1368509","article-title":"An improved version of Chubanov\u2019s method for solving a homogeneous feasibility problem","volume":"33","author":"Roos","year":"2018","journal-title":"Optim. Methods. Softw."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Floudas, C.A., and Pardalos, P.M. (2009). Fourier-Motzkin elimination method. Encyclopedia of Optimization, Springer.","DOI":"10.1007\/978-0-387-74759-0"},{"key":"ref_15","first-page":"1307","article-title":"Paralel solver of large systems of linear inequalities using Fourier-Motzkin elimination","volume":"35","author":"Fritsch","year":"2016","journal-title":"Comput. Inform."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T. (1970). Convex Analysis, Princeton University Press.","DOI":"10.1515\/9781400873173"},{"key":"ref_17","first-page":"80","article-title":"Nesterov. One class of methods of unconditional minimization of a convex function, having a high rate of convergence","volume":"24","author":"Nesterov","year":"1984","journal-title":"USSR"},{"key":"ref_18","unstructured":"Poliak, B. (1987). Introduction to Optimization, Optimization Software, Inc."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/4\/465\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:48:11Z","timestamp":1760161691000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/4\/465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,15]]},"references-count":18,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2021,4]]}},"alternative-id":["e23040465"],"URL":"https:\/\/doi.org\/10.3390\/e23040465","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2021,4,15]]}}}