IEEE Computational Science & Engineering
Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
SIAM Journal on Numerical Analysis
A comparison of complete global optimization solvers
Mathematical Programming: Series A and B
Interval Analysis on Directed Acyclic Graphs for Global Optimization
Journal of Global Optimization
Transposition Theorems and Qualification-Free Optimality Conditions
SIAM Journal on Optimization
A scaling algorithm for polynomial constraint satisfaction problems
Journal of Global Optimization
Optimization Methods & Software - GLOBAL OPTIMIZATION
Constraint propagation on quadratic constraints
Constraints
Standardized interval arithmetic and interval arithmetic used in libraries
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations
SIAM Journal on Matrix Analysis and Applications
GloMIQO: Global mixed-integer quadratic optimizer
Journal of Global Optimization
First order rejection tests for multiple-objective optimization
Journal of Global Optimization
| Hi-index | 0.00 |
GloptLab is an easy-to-use testing and development platform for solving quadratic constraint satisfaction problems, written in Matlab. The algorithms implemented in GloptLab are used to reduce the search space: scaling, constraint propagation, linear relaxations, strictly convex enclosures, conic methods, and branch and bound. All these methods are rigorous; hence, it is guaranteed that no feasible point is lost. Finding and verifying feasible points complement the reduction methods. From the method repertoire custom-made strategies can be built, with a user-friendly graphical interface. GloptLab was tested on a large test set of constraint satisfaction problems, and the results show the importance of composing a clever strategy.