On smooth reformulations and direct non-smooth computations for minimax problems
From MaRDI portal
Publication:386469
DOI10.1007/s10898-012-0014-1zbMath1282.90233OpenAlexW2159212771MaRDI QIDQ386469
Sowmya Muniswamy, Ralph Baker Kearfott, Xinyu Li, Qian Wang, Yi Wang
Publication date: 9 December 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-0014-1
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26)
Related Items
A QP-free algorithm for finite minimax problems, Mathematically Rigorous Global Optimization and Fuzzy Optimization, On rigorous upper bounds to a global optimum, Exclusion regions for optimization problems, Some observations on exclusion regions in branch and bound algorithms
Uses Software
Cites Work
- Unnamed Item
- The cluster problem in multivariate global optimization
- Rigorous global search: continuous problems
- Approximation in normed linear spaces
- Slope intervals, generalized gradients, semigradients, slant derivatives, and csets
- Solving minimax problems by interval methods
- Interval computations, rigour and non-rigour in deterministic continuous global optimization
- GlobSol user guide
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- Interval Methods for Systems of Equations
- A Proof of Convergence and an Error Bound for the Method of Bisection in R n
- The Minimax Solution of an Overdetermined System of Non-linear Equations
- Validated Linear Relaxations and Preprocessing: Some Experiments
- Reliable minimax parameter estimation
