Finding a minimax with specified accuracy

zbMATH Open0832.65059MaRDI QIDQ1903902

V. R. Fazylov

Publication date: 13 December 1995

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

zbMATH Keywords

Hilbert spacesconvex programmingminimax problemconvex functionsnon-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)

Related Items (2)

Method for the determination of the minimax ⋮ Finding approximate solutions to minimax problems

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Finding the minimax with the aid of a dynamic system 👍 👎
• A method for the determination of the minimax 👍 👎
• Finding approximate solutions to minimax problems 👍 👎
• Error bounds for a near-minimax approximation 👍 👎
• Method for the determination of the minimax 👍 👎
• An algorithm for minimax 👍 👎
• Minimax approximation from a least squares solution 👍 👎

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)