Minmaxmin problems revisited

DOI10.1080/1055678021000060810MaRDI QIDQ4405942zbMATH OpenOpenAlexFDO

Authors

Publication date 7 October 2003

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/1055678021000060810

zbMATH Keywords

exchange algorithmminimaxminmaxmin problemsoptimality conditions

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Minimax problems in mathematical programming (90C47)

Recommendations

• The solution of discrete minimax problems
• scientific article; zbMATH DE number 4064388
• A smooth method for the finite minimax problem
• Stochastic methods for solving minimax problems
• On solving some classes of multiple minimax problems

Cites work

• A Discrete Chebyshev Approximation Problem by Means of Several Polynomials
• Best piecewise polynomial approximation
• Convex Analysis
• Descent methods for quasidifferentiable minimization
• scientific article; zbMATH DE number 3932969 (Why is no real title available?)
• scientific article; zbMATH DE number 872150 (Why is no real title available?)
• scientific article; zbMATH DE number 3247810 (Why is no real title available?)
• scientific article; zbMATH DE number 3358251 (Why is no real title available?)
• Nondifferentiable optimization: motivations and applications. Proceedings of an IIASA (International Institute for Applied Systems Analysis) Workshop on Nondifferentiable Optimization Held at Sopron, Hungary, September 17-22, 1984
• Optimization. Algorithms and consistent approximations
• Quadratic rate of convergence of a linearization method for solving discrete minimax problems
• Quasidifferentiability and related topics. Dedicated to Prof. Franco Giannessi on his 65th birthday and to Prof. Diethard Pallaschke on his 60th birthday
• Semismooth and Semiconvex Functions in Constrained Optimization
• The rate of convergence of a method of equalizing maxima

Cited in

(24)

• Conspiracy numbers for min-max search
• Dynamic min-max problems
• The solution of discrete minimax problems
• The directions of decrease for minmaxmin problems
• Continuous minimax optimization using modal intervals
• The balance problem of min-max systems is co-nNP hard
• scientific article; zbMATH DE number 6378818 (Why is no real title available?)
• On Iterated Minimization in Nonconvex Optimization
• scientific article; zbMATH DE number 3869007 (Why is no real title available?)
• On the Reduction of some multiple minimax problems with connected restrictions
• A method of seeking the stationary points of a connected max-min
• An approach to robust network design in telecommunications
• An approach to classification based on separation of sets by means of several ellipsoids
• An algorithm for minimax
• scientific article; zbMATH DE number 51950 (Why is no real title available?)
• scientific article; zbMATH DE number 1923167 (Why is no real title available?)
• Mathematical diagnostics via nonsmooth analysis
• Max–min separability
• scientific article; zbMATH DE number 2221954 (Why is no real title available?)
• Essentials of numerical nonsmooth optimization
• Essentials of numerical nonsmooth optimization
• On solving some classes of multiple minimax problems
• On the solution of min-sum-min problems
• Robust network design in telecommunications under polytope demand uncertainty

This page was built for publication: Minmaxmin problems revisited

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