Adaptive methods for solvings minimax problems∗
From MaRDI portal
Publication:2767578
DOI10.1080/02331930108844554zbMATH Open0995.90096OpenAlexW2086634279MaRDI QIDQ2767578FDOQ2767578
Authors: Rafail Gabasov, Faina Mihaǐlovna Kirillova, E. A. 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
Recommendations
Minimax problems in mathematical programming (90C47) Numerical methods based on necessary conditions (49M05)
Cites Work
- Title not available (Why is that?)
- Linear Programming Techniques for Regression Analysis
- An Exact Penalty Method for Constrained, Discrete, Linear $l_\infty $ Data Fitting
- Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Note on Jordan elimination, linear programming and Tchebyscheff approximation
- Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
- The historical development of the linear minimax absolute residual estimation procedure 1786--1960
- Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the $l_\infty $ Sense?
- Das Austauschverfahren der linearen Tschebyscheff-Approximation bei nicht erfüllter Haarscher Bedingung
- An algorithm for discrete Chebyshev linear approximation with linear constraints
Cited In (4)
Uses Software
This page was built for publication: Adaptive methods for solvings minimax problems∗
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2767578)