Quadratic minimization and maximization

Бесплатный доступ

In this paper we consider the quadratic programming which consists of convex quadratic maximization and convex quadratic minimization. Based on optimality conditions, we propose algorithms for solving these problems.

Quadratic maximization, quadratic minimization, algorithm, convergence

Короткий адрес: https://sciup.org/14835107

IDR: 14835107

Статья научная