Projective-Dual Method for Solving Systems of Linear Equations with Nonnegative Variables


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

In order to solve an underdetermined system of linear equations with nonnegative variables, the projection of a given point onto its solutions set is sought. The dual of this problem—the problem of unconstrained maximization of a piecewise-quadratic function—is solved by Newton’s method. The problem of unconstrained optimization dual of the regularized problem of finding the projection onto the solution set of the system is considered. A connection of duality theory and Newton’s method with some known algorithms of projecting onto a standard simplex is shown. On the example of taking into account the specifics of the constraints of the transport linear programming problem, the possibility to increase the efficiency of calculating the generalized Hessian matrix is demonstrated. Some examples of numerical calculations using MATLAB are presented.

作者简介

B. Ganin

Dorodnitsyn Computing Center

Email: gol-a@yandex.ru
俄罗斯联邦, Moscow, 119333

A. Golikov

Dorodnitsyn Computing Center

编辑信件的主要联系方式.
Email: gol-a@yandex.ru
俄罗斯联邦, Moscow, 119333

Yu. Evtushenko

Dorodnitsyn Computing Center

Email: gol-a@yandex.ru
俄罗斯联邦, Moscow, 119333

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2018