Cargando…
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...
Autores principales: | Prusińska, Agnieszka, Szkatuła, Krzysztof, Tret’yakov, Alexey |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8071127/ https://www.ncbi.nlm.nih.gov/pubmed/33920784 http://dx.doi.org/10.3390/e23040465 |
Ejemplares similares
-
On the Finite Complexity of Solutions in a Degenerate System of Quadratic Equations: Exact Formula
por: Brezhneva, Olga, et al.
Publicado: (2023) -
Piecewise Polynomial Representations of Genomic Tracks
por: Tarabichi, Maxime, et al.
Publicado: (2012) -
Piecewise quadratic growth during the 2019 novel coronavirus epidemic
por: Brandenburg, Axel
Publicado: (2020) -
Evaluation of Piecewise Polynomial Equations for Two Types of Thermocouples
por: Chen, Andrew, et al.
Publicado: (2013) -
Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
por: Baltean-Lugojan, Radu, et al.
Publicado: (2017)