On smooth reformulations and direct non-smooth computations for minimax problems
From MaRDI portal
Publication:386469
DOI10.1007/S10898-012-0014-1zbMATH Open1282.90233OpenAlexW2159212771MaRDI QIDQ386469FDOQ386469
Authors: Ralph Baker Kearfott, Sowmya Muniswamy, Xinyu Li, Yi Wang, Qian 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
Recommendations
Nonconvex programming, global optimization (90C26) Minimax problems in mathematical programming (90C47)
Cites Work
- Rigorous global search: continuous problems
- Interval Methods for Systems of Equations
- Title not available (Why is that?)
- The cluster problem in multivariate global optimization
- GlobSol user guide
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- Validated Linear Relaxations and Preprocessing: Some Experiments
- The Minimax Solution of an Overdetermined System of Non-linear Equations
- 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
- A Proof of Convergence and an Error Bound for the Method of Bisection in R n
- Reliable minimax parameter estimation
Cited In (5)
Uses Software
This page was built for publication: On smooth reformulations and direct non-smooth computations for minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386469)