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

DOI10.1134/S0965542518020057MaRDI QIDQ1644007zbMATH OpenOpenAlexFDO

Authors B. V. Ganin, A. I. Golikov, Yu. 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

regularizationunconstrained optimizationdualitygeneralized 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)

Cites work

• scientific article; zbMATH DE number 3313117 (Why is no real title available?)
• A Newton method for linear programming
• Comparative study of two fast algorithms for projecting a point to the standard simplex
• Experience in organizing hybrid parallel calculations in the Evtushenko-Golikov method for problems with block-angular structure
• On quadratic and complete quadratic problems of convex programming
• Parallel implementation of Newton's method for solving large scale linear programs
• Quadratic approximation of penalty functions for solving large-scale linear programs
• Solution method for a large-scale linear programming problems
• Two fast algorithms for projecting a point onto the canonical simplex

Cited in

(3)

• Newton-type method for solving systems of linear equations and inequalities
• Inexact Newton Method for Minimization of Convex Piecewise Quadratic Functions
• Projective re-normalization for improving the behavior of a homogeneous conic linear system

Describes a project that uses

Uses Software

• Matlab

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1644007)