Finding a minimax with specified accuracy

MaRDI QIDQ1903902zbMATH OpenFDO

Authors V. R. Fazylov

Publication date 13 December 1995

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

zbMATH Keywords

convex functionsconvex programmingHilbert spacesminimax problemnon-differentiable optimizationfinite method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) General theory of numerical analysis in abstract spaces (65J05) Programming in abstract spaces (90C48)

Recommendations

• Finding approximate solutions to minimax problems
• A method for the determination of the minimax
• Method for the determination of the minimax
• Finding the minimax with the aid of a dynamic system
• Publication:3491320
• Minimax approximation from a least squares solution
• An algorithm for minimax
• scientific article; zbMATH DE number 5027086
• Error bounds for a near-minimax approximation

Cited in

(7)

• A Regularization Method for Solving the Finite Convex Min-Max Problem
• scientific article; zbMATH DE number 4176837 (Why is no real title available?)
• A class of algorithms for computing the minimal value of a convex functionfover[0 1]^kwithin accuracy ∊, when the evaluations offare made within accuracy ∊
• Method for the determination of the minimax
• Finding approximate solutions to minimax problems
• The method of convex programming with a prescribed absolute-relative error
• scientific article; zbMATH DE number 3968345 (Why is no real title available?)

This page was built for publication: Finding a minimax with specified accuracy

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