Complete search in continuous global optimization and constraint satisfaction
By Arnold Neumaier. Acta Numerica, 2004
500 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/41b6b7737113557347f993f1fe7e68be484708a6
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Denis V. Efimov
- Ali Zolghadri
- Boris Houska
- Paul Embrechts
- Mario Eduardo Villanueva
- Tarek Raïssi
- Radoslav Paulen
- Nikola D. Peric
In Numerical Analysis
- Denis V. Efimov
- Ali Zolghadri
- Boris Houska
- Paul Embrechts
- Mario Eduardo Villanueva
- Tarek Raïssi
- Radoslav Paulen
- Nikola D. Peric
Citations in the corpus
- Aggregating risk capital, with an application to operational risk (2006, background): “We refer to Neumaier (2004) for a comprehensive review.”
- Set-Theoretic Approaches in Analysis, Estimation and Control of Nonlinear Systems (2015, methodology): “Instead of attempting to solve these problems directly, one can construct polyhedral relaxations in the form of linear programs (LPs), similar to the approach used for bound contraction in branchand-bound search (see, e.g., Neumaier, 2004; Tawarmalani and Sahinidis, 2004).”
- Interval State Estimation for a Class of Nonlinear Systems (2012, methodology): “Otherwise, constraint propagation techniques based on interval analysis [18], [29] can be used to solve the problem (21) in a reliable way by generating a conservative set of boxes that are guaranteed to contain the exact solution set of the state values.”
- Advanced global optimisation for mission analysis and design (2004, background): “Neumaier [33] describes four classes of global optimisation algorithms.”