Projective-dual method for solving systems of linear equations with nonnegative variables
type: Item
instance of: scholarly article
title: Projective-dual method for solving systems of linear equations with nonnegative variables
DOI: 10.1134/S0965542518020057
author: B. V. Ganin
author: A. I. Golikov
author: Yu. G. Evtushenko
published in: Computational Mathematics and Mathematical Physics
publication date: 2018-06-21T00:00:00Z
Mathematics Subject Classification ID: 65-XX
Mathematics Subject Classification ID: 90-XX
zbMATH DE Number: 6892369
zbMATH Keywords: systems of linear equations with nonnegative variables
zbMATH Keywords: regularization
zbMATH Keywords: projection of a point
zbMATH Keywords: duality
zbMATH Keywords: generalized Newton's method
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: transport linear programming problem
describes a project that uses: Matlab
MaRDI profile type: Publication
cites work: Solution method for a large-scale linear programming problems
cites work: Parallel implementation of Newton’s method for solving large-scale linear programs
cites work: A Newton method for linear programming
cites work: Quadratic approximation of penalty functions for solving large-scale linear programs
cites work: Experience in organizing hybrid parallel calculations in the Evtushenko-Golikov method for problems with block-angular structure
cites work: On quadratic and complete quadratic problems of convex programming
cites work: Q5593512
cites work: Two fast algorithms for projecting a point onto the canonical simplex
cites work: Comparative study of two fast algorithms for projecting a point to the standard simplex
full work available at URL: s0965542518020057
OpenAlex ID: W2790767182
description: scientific article; zbMATH DE number 6892369