Adaptive methods for solvings minimax problems∗
From MaRDI portal
Publication:2767578
Recommendations
Cites work
- Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]
- Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
- An algorithm for discrete Chebyshev linear approximation with linear constraints
- An Exact Penalty Method for Constrained, Discrete, Linear $l_\infty $ Data Fitting
- Das Austauschverfahren der linearen Tschebyscheff-Approximation bei nicht erfüllter Haarscher Bedingung
- scientific article; zbMATH DE number 3915531 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3690528 (Why is no real title available?)
- scientific article; zbMATH DE number 3562346 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- Linear Programming Techniques for Regression Analysis
- Note on Jordan elimination, linear programming and Tchebyscheff approximation
- Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the $l_\infty $ Sense?
- The historical development of the linear minimax absolute residual estimation procedure 1786--1960
Cited in
(5)- scientific article; zbMATH DE number 4209908 (Why is no real title available?)
- Dual Techniques for Minimax
- An adaptive high-order minimum action method
- Computational method for minimax optimization in the time domain
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
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)