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

Author:

Prusińska AgnieszkaORCID,Szkatuła KrzysztofORCID,Tret’yakov AlexeyORCID

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.

Funder

Ministerstwo Nauki i Szkolnictwa Wyższego

Publisher

MDPI AG

Subject

General Physics and Astronomy

Reference18 articles.

1. Mathematical Programming;Karmanov,1989

2. Theorems of the alternative and their applications in numerical methods;Golikov;Comput. Math. Math. Phys.,2003

3. New perspective on the theorems of alternative;Evtushenko,2003

4. A finite-termination gradient projection method for solving systems of linear inequalities

5. Exact differentiable penalty for a problem of quadratic programming with the use of a gradient-projective method

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3