New contraction methods for linear inequalities

DOI10.1016/0024-3795(94)90006-XzbMath0807.65061OpenAlexW2109093355MaRDI QIDQ1334912

V. Pereyra

Publication date: 26 September 1994

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(94)90006-x

zbMATH Keywords

convergencenumerical exampleslinear inequalitiesglobal linear convergenceUzawa's methoditerative contraction algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Linear inequalities of matrices (15A39)

Related Items (1)

Entropic perturbation method for solving a system of linear inequalities

Cites Work

• New methods for linear inequalities
• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• Linear complementarity problems solvable by A single linear program
• On solving linear complementarity problems as linear programs
• AN APPLICATION OF THE METHOD OF STEEPEST DESCENTS TO THE SOLUTION OF SYSTEMS OF NON-LINEAR SIMULTANEOUS EQUATIONS
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New contraction methods for linear inequalities