Polynomial-complexity GLRT-optimal noncoherent PNC

2016 ◽  
Author(s):  
Maria Gkizeli ◽  
George N. Karystinos
Keyword(s):  
Polynomial Complexity

scholarly journals On the Locally Polynomial Complexity of the Projection-Gradient Method for Solving Piecewise Quadratic Optimisation Problems

Entropy ◽  
2021 ◽  
Vol 23 (4) ◽  
pp. 465
Author(s):  
Agnieszka Prusińska ◽  
Krzysztof Szkatuła ◽  
Alexey Tret’yakov
Keyword(s):  
Computational Complexity ◽  
Polynomial Complexity ◽  
Initial Point ◽  
Quadratic Functions ◽  
Problem Dimension ◽  
Piecewise Quadratic Functions ◽  
Large Systems ◽  
Systems Of Linear Inequalities ◽  
Number Of Iterations ◽  
Finite Number Of Iterations

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.

Sign in / Sign up

Export Citation Format

Share Document