On the Locally Polynomial Complexity of the Projection-Gradient Method for Solving Piecewise Quadratic Optimisation Problems
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...
Main Authors: | Agnieszka Prusińska, Krzysztof Szkatuła, Alexey Tret’yakov |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-04-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/23/4/465 |
Similar Items
-
Uniqueness theorem for sequences of piecewise polynomial functions
by: Karen Keryan
Published: (2017-06-01) -
Uniqueness theorem for sequences of piecewise polynomial functions
by: Karen Keryan
Published: (2017-06-01) -
Uniqueness theorem for sequences of piecewise polynomial functions
by: Karen Keryan
Published: (2017-06-01) -
Piecewise polynomial system approximation for nonlinear control
by: Paul, Peter
Published: (1994) -
Evaluation of Piecewise Polynomial Equations for Two Types of Thermocouples
by: Andrew Chen, et al.
Published: (2013-12-01)