Minmaxmin problems revisited
From MaRDI portal
Publication:4405942
DOI10.1080/1055678021000060810zbMath1038.90095OpenAlexW2022881263MaRDI QIDQ4405942
No author found.
Publication date: 7 October 2003
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/1055678021000060810
Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46)
Related Items (9)
Mathematical diagnostics via nonsmooth analysis ⋮ Max–min separability ⋮ An approach to robust network design in telecommunications ⋮ An approach to classification based on separation of sets by means of several ellipsoids ⋮ Continuous minimax optimization using modal intervals ⋮ Robust network design in telecommunications under polytope demand uncertainty ⋮ Essentials of numerical nonsmooth optimization ⋮ Essentials of numerical nonsmooth optimization ⋮ On the solution of min-sum-min problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Descent methods for quasidifferentiable minimization
- Best piecewise polynomial approximation
- Optimization. Algorithms and consistent approximations
- Quasidifferentiability and related topics. Dedicated to Prof. Franco Giannessi on his 65th birthday and to Prof. Diethard Pallaschke on his 60th birthday
- The rate of convergence of a method of equalizing maxima
- Semismooth and Semiconvex Functions in Constrained Optimization
- A Discrete Chebyshev Approximation Problem by Means of Several Polynomials
- Quadratic rate of convergence of a linearization method for solving discrete minimax problems
- Convex Analysis
This page was built for publication: Minmaxmin problems revisited
