A row relaxation method for large minimax problems

DOI10.1007/BF01989749zbMath0787.65035MaRDI QIDQ688632

Achiya Dax

Publication date: 24 May 1994

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

numerical resultsdoubly regularized minimax problemlarge minimax problemsrow relaxation method

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (1)

A proximal point algorithm for minimax problems

Cites Work

• Unnamed Item
• Unnamed Item
• An automatic relaxation method for solving interval linear inequalities
• Parallel application of block-iterative methods in medical imaging and radiation therapy
• An iterative row-action method for interval convex programming
• A row relaxation method for large \(l_ 1\) problems
• Column Relaxation Methods for Least Norm Problems
• Successive Refinement of Large Multicell Models
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
• Nonlinear Perturbation of Linear Programs
• A Storage-Efficient Algorithm for Finding the Regularized Solution of a Large, Inconsistent System of Equations
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Iterative Solution of Linear Programs
• A relaxation method for reconstructing objects from noisy X-rays
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: A row relaxation method for large minimax problems