Finding approximate solutions to minimax problems

MaRDI QIDQ1569265zbMATH OpenFDO

Authors Sh. I. Galiev

Publication date 29 June 2000

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

approximate solutionsminimax problemspackingpenalty coefficientstwo-dimensional spheres

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Existence of solutions for minimax problems (49J35) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Numerical methods in optimal control (49M99)

Recommendations

• Solving minimax problems by interval methods
• scientific article; zbMATH DE number 939066
• Minimax approximation from a least squares solution
• Approximate optimality conditions for minimax programming problems
• Exact Solutions for Minimax Optimization Problems
• Finding a minimax with specified accuracy
• scientific article; zbMATH DE number 3874965
• Solving 0-1 Minimax Problems
• The solution of discrete minimax problems
• scientific article; zbMATH DE number 5027086

Cited in

(4)

• Solving 0-1 Minimax Problems
• Directions of decrease for minimax problems
• Solving minimax problems by interval methods
• Finding a minimax with specified accuracy

This page was built for publication: Finding approximate solutions to minimax problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569265)