On the public citation graph
Solving minimax problems by interval methods
0 signed · 55 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01396702openalex-snapshot
Global optimization using interval analysis ? the multi-dimensional case
inferredcites →https://doi.org/10.1007/bf01933165openalex-snapshot
Bounding solutions of systems of equations using interval analysis
inferredcites →https://doi.org/10.1007/bf02241818openalex-snapshot
Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
inferredcites →https://doi.org/10.1016/0378-4754(85)90023-0openalex-snapshot
Computer methods for the range of functions
inferredcites →https://doi.org/10.1017/cbo9780511526473openalex-snapshot
Interval Methods for Systems of Equations
inferredcites →https://doi.org/10.1137/0709036openalex-snapshot
A Sequential Method Seeking the Global Maximum of a Function
inferredcites →https://doi.org/10.1137/0722037openalex-snapshot
Interval Slopes for Rational Functions and Associated Centered Forms
inferredcites →https://doi.org/10.1137/0722053openalex-snapshot
Optimal Search for the Global Maximum of Functions with Bounded Seminorm
inferredcites →https://doi.org/10.1137/0724017openalex-snapshot
Overestimation in Linear Interval Equations
inferredcites →https://doi.org/10.1137/1.9781611970906openalex-snapshot
Methods and Applications of Interval Analysis
inferredcites →https://doi.org/10.2307/2008155openalex-snapshot
Computer Methods for the Range of Functions.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/aic.17857openalex-snapshot
Constrained robust Bayesian optimization of expensive noisy black‐box functions with guaranteed regret bounds
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_224openalex-snapshot
Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Global optimization: Application to phase equilibrium problems; Interval analysis: Application to chemical engineering design problems; Interval analysis:…
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_297openalex-snapshot
Interval Analysis: Nondifferentiable Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-13795-3_4openalex-snapshot
Branch-and-Bound-Type Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-31041-7_17openalex-snapshot
Interval Methods for Solving Various Kinds of Quantified Nonlinear Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-40861-8_30openalex-snapshot
Minimax Self Playing Game Alquerque
inferred← citeshttps://doi.org/10.1007/bf01279453openalex-snapshot
A branch and bound algorithm for bound constrained optimization problems without derivatives
inferred← citeshttps://doi.org/10.1007/bf02276877openalex-snapshot
Interval extensions of non-smooth functions for global optimization and nonlinear systems solvers
inferred← citeshttps://doi.org/10.1007/s00158-015-1236-xopenalex-snapshot
Efficient global robust optimization of unconstrained problems affected by parametric uncertainties
inferred← citeshttps://doi.org/10.1007/s10898-007-9260-zopenalex-snapshot
Global solution of bilevel programs with a nonconvex inner program
inferred← citeshttps://doi.org/10.1007/s10898-008-9395-6openalex-snapshot
Towards global bilevel dynamic optimization
inferred← citeshttps://doi.org/10.1007/s10898-009-9479-yopenalex-snapshot
Global solution of nonlinear mixed-integer bilevel programs
inferred← citeshttps://doi.org/10.1007/s10898-012-0014-1openalex-snapshot
On smooth reformulations and direct non-smooth computations for minimax problems
inferred← citeshttps://doi.org/10.1007/s10898-018-0679-1openalex-snapshot
A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
inferred← citeshttps://doi.org/10.1007/s12293-016-0180-7openalex-snapshot
A simplex social spider algorithm for solving integer programming and minimax problems
inferred← citeshttps://doi.org/10.1007/s12597-016-0256-7openalex-snapshot
Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems
inferred← citeshttps://doi.org/10.1007/springerreference_72375openalex-snapshot
Interval Analysis: Nondifferentiable Problems
inferred← citeshttps://doi.org/10.1016/b978-0-444-59520-1.50116-0openalex-snapshot
Global Solution of Min-Max Optimization Problems for Nonlinear Dynamic Systems
inferred← citeshttps://doi.org/10.1016/j.amc.2007.06.026openalex-snapshot
Interval method for global solutions of a class of min–max–min problems
inferred← citeshttps://doi.org/10.1016/j.amc.2022.126970openalex-snapshot
Development of modal interval algorithm for solving continuous minimax problems
inferred← citeshttps://doi.org/10.1016/j.jmaa.2007.04.003openalex-snapshot
Continuous minimax optimization using modal intervals
inferred← citeshttps://doi.org/10.1016/j.proeng.2012.01.1130openalex-snapshot
Interval Maximum-Entropy Method for Min-Max-Min Problem☆
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00421-0openalex-snapshot
Interval mathematics, algebraic equations and optimization
inferred← citeshttps://doi.org/10.1021/ie5029123openalex-snapshot
Semi-Infinite Optimization with Implicit Functions
inferred← citeshttps://doi.org/10.1023/a:1016246616462openalex-snapshot
Search Heuristics for Box Decomposition Methods
inferred← citeshttps://doi.org/10.1023/a:1016568309421openalex-snapshot
Recent approaches to global optimization problems through Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1023/b:reom.0000032107.85627.45openalex-snapshot
Slope Intervals, Generalized Gradients, Semigradients, Slant Derivatives, and Csets
inferred← citeshttps://doi.org/10.1109/cec.2002.1004477openalex-snapshot
Particle swarm optimization for minimax problems
inferred← citeshttps://doi.org/10.1109/cise.2010.5677080openalex-snapshot
Interval Algorithm for a Class of Continuous Minimax Problems
inferred← citeshttps://doi.org/10.1109/icsmc.2011.6083984openalex-snapshot
A novel method for solving min-max problems by using a modified particle swarm optimization
inferred← citeshttps://doi.org/10.1142/s1469026818500220openalex-snapshot
Multidirectional Grey Wolf Optimizer Algorithm for Solving Global Optimization Problems
inferred← citeshttps://doi.org/10.1186/s40064-016-2064-1openalex-snapshot
A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1122openalex-snapshot
Adaptive Bundle Methods for Nonlinear Robust Optimization
inferred← citeshttps://doi.org/10.13140/2.1.1775.4409openalex-snapshot
Evaluation of Process Systems Operating Envelopes
inferred← citeshttps://doi.org/10.1504/ijrs.2011.041186openalex-snapshot
Robust simulation and design using semi-infinite programs with implicit functions
inferred← citeshttps://doi.org/10.15866/irecos.v10i1.4612openalex-snapshot
Multiple-Population Genetic Algorithm for Solving Min-Max Optimization Problems
inferred← citeshttps://doi.org/10.3390/math9060631openalex-snapshot
Combining Grammatical Evolution with Modal Interval Analysis: An Application to Solve Problems with Uncertainty
inferred← citeshttps://doi.org/10.36959/643/303openalex-snapshot
Solving Integer Programming Problems by Hybrid Bat Algorithm and Direct Search Method
inferred← citeshttps://doi.org/10.3934/naco.2017020openalex-snapshot
A simplex grey wolf optimizer for solving integer programming and minimax problems
inferred← citeshttps://doi.org/10.4018/978-1-61520-666-7.ch011openalex-snapshot
Applications in Multiobjective, Constrained and Minimax Problems
inferred← citeshttps://doi.org/10.4208/eajam.030915.210416aopenalex-snapshot
Direct Gravitational Search Algorithm for Global Optimisation Problems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.