Related Experiment Video
Updated: Nov 7, 2025

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
On the Locally Polynomial Complexity of the Projection-Gradient Method for Solving Piecewise Quadratic Optimisation
Agnieszka Prusińska1, Krzysztof Szkatuła1,2, Alexey Tret'yakov1,2,3
1Faculty of Exact and Natural Sciences, Siedlce University, 08-110 Siedlce, Poland.
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.
Related Concept Videos
Quadratic Equations
Quadratic Models
Quadratic Equations in the Complex Number System
Application of Nonlinear Inequalities
Gaussian Elimination: Problem Solving
Synthetic Disvision of Polynomials
