Adaptive methods for solvings minimax problems∗

DOI10.1080/02331930108844554zbMath0995.90096MaRDI QIDQ2767578

Rafail Gabasov, Faina Mihaǐlovna Kirillova, Ekaterina Kostina

Publication date: 5 June 2002

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930108844554

zbMATH Keywords

adaptive methods; minimax problems; finite algorithms

Mathematics Subject Classification ID

90C47: Minimax problems in mathematical programming

49M05: Numerical methods based on necessary conditions

Uses Software

• NAG
• nag

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• The historical development of the linear minimax absolute residual estimation procedure 1786--1960
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• Linear Programming Techniques for Regression Analysis
• Das Austauschverfahren der linearen Tschebyscheff-Approximation bei nicht erfüllter Haarscher Bedingung
• An Exact Penalty Method for Constrained, Discrete, Linear $l_\infty $ Data Fitting
• Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the $l_\infty $ Sense?
• An algorithm for discrete Chebyshev linear approximation with linear constraints
• Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]