Adaptive methods for solvings minimax problems∗

DOI10.1080/02331930108844554MaRDI QIDQ2767578zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

minimax problemsadaptive methodsfinite algorithms

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Numerical methods based on necessary conditions (49M05)

Recommendations

• Dual Techniques for Minimax
• scientific article; zbMATH DE number 3937922
• Solving large-scale minimax problems with the primal-dual steepest descent algorithm
• Smooth Optimization Methods for Minimax Problems
• scientific article; zbMATH DE number 871324

Cites work

• 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?)
• 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 Exact Penalty Method for Constrained, Discrete, Linear $l_\infty $ Data Fitting
• An algorithm for discrete Chebyshev linear approximation with linear constraints
• Das Austauschverfahren der linearen Tschebyscheff-Approximation bei nicht erfüllter Haarscher Bedingung
• 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

(4)

• An adaptive high-order minimum action method
• Dual Techniques for Minimax
• Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
• Computational method for minimax optimization in the time domain

Describes a project that uses

Uses Software

• nag
• NAG

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)