Cited in
(34)- \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- A comparison of complete global optimization solvers
- Exploiting binary floating-point representations for constraint propagation
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- Global optimization
- GLOPT
- INTBIS
- PROFIL/BIAS
- GLOPTLAB
- MSNLP
- RealPaver
- CFSQP
- COCONUT
- COPRIN
- ALIAS
- GlobSol
- Lurupa
- coco_gop_ex
- PSICO
- IbexOpt
- FloPSy
- AUSTIN
- Numerica
- Newton
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- Domain reduction techniques for global NLP and MINLP optimization
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Constraint propagation on quadratic constraints
- Enhancing numerical constraint propagation using multiple inclusion representations
- Rigorous filtering using linear relaxations
- Solving kinematics problems by efficient interval partitioning
- Adaptive parameterized improving hit-and-run for global optimization
This page was built for software: ICOS
