Projective-dual method for solving systems of linear equations with nonnegative variables

DOI10.1134/S0965542518020057OpenAlexW2790767182MaRDI QIDQ1644007

A. I. Golikov, B. V. Ganin, Yuri G. Evtushenko

Publication date: 21 June 2018

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542518020057

zbMATH Keywords

unconstrained optimizationregularizationdualitygeneralized Newton's methodprojection of a pointsystems of linear equations with nonnegative variablestransport linear programming problem

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Related Items (2)

Inexact Newton Method for Minimization of Convex Piecewise Quadratic Functions ⋮ Newton-type method for solving systems of linear equations and inequalities

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Two fast algorithms for projecting a point onto the canonical simplex
• Experience in organizing hybrid parallel calculations in the Evtushenko-Golikov method for problems with block-angular structure
• A Newton method for linear programming
• On quadratic and complete quadratic problems of convex programming
• Solution method for a large-scale linear programming problems
• Comparative study of two fast algorithms for projecting a point to the standard simplex
• Parallel implementation of Newton’s method for solving large-scale linear programs
• Quadratic approximation of penalty functions for solving large-scale linear programs

This page was built for publication: Projective-dual method for solving systems of linear equations with nonnegative variables