A new exclusion test for finding the global minimum
From MaRDI portal
(Redirected from Publication:869487)
Recommendations
Cites work
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 41948 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations
- A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
- A global optimization technique for checking parametric robustness
- A new exclusion test.
- Bayesian heuristic approach to discrete and global optimization. Algorithms, visualization, software, and applications. Incl. 2 disks
- Cell-to-cell mapping. A method of global analysis for nonlinear systems
- Developments in global optimization. Proceedings of the 3rd workshop, Szeged, Hungary, December 10--14, 1995
- Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
- Estimation of the Lipschitz constant of a function
- Evaluating Lipschitz constants for functions given by algorithms
- Extension of Piyavskii's algorithm to continuous global optimization
- Global optimization
- Global optimization using interval analysis: The one-dimensional case
- Improving the efficiency of exclusion algorithms
- Introduction to global optimization.
- NP-Hardness of Some Linear Control Design Problems
- On the complexity of exclusion algorithms for optimization
- On using estimates of Lipschitz constants in global optimization
- Optimization in computational chemistry and molecular biology. Local and global approaches. Conference, Princeton Univ., Princeton, NJ, USA, May 7--9, 1999
- Rigorous global search: continuous problems
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
Cited in
(5)- Algorithms for optimization problems with exclusion constraints
- Lipschitz condition for finding real roots of a vector function
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- On the complexity of exclusion algorithms for optimization
- AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS
This page was built for publication: A new exclusion test for finding the global minimum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869487)