×

ICOS

swMATH ID: 4007
Software Authors: Lebbah, Y.
Description: ICOS: a branch and bound based solver for rigorous global optimization. This article describes a software package called Interval Constraint Solver (ICOS), which implements a branch and bound algorithm for rigorously solving global optimization problems. The ICOS library contains algorithms coming from constraint programming, interval analysis, and linear relaxation techniques. It contains an interface to linear programming solvers and local optimization solvers (e.g. Coin/Clp, Cplex, and IpOpt). ICOS has also its own AMPL parser, which enables calling ICOS binary code in a Unix-like command. The ICOS strategy language enables combining and parameterizing existing algorithms for solving optimization problems. Thus, the user can develop his own solving strategies without changing anything in the ICOS internal architecture. Various examples are given to show how the strategy language can be used. We give an overview of ICOS design, implementation, and a quick user’s guide.
Homepage: https://sites.google.com/site/ylebbah/icos
Operating Systems: Linux, Windows/Cygwin binary (under development)
Keywords: global optimization; interval analysis; constraint programming; problem solving
Related Software: BARON; Numerica; COCONUT; RealPaver; ANTIGONE; LINDO; GlobSol; PROFIL/BIAS; INTOPT_90; INTBIS; AMPL; GLOPTLAB; CONOPT; Ipopt; Couenne; IbexOpt; coco_gop_ex; GLOBALLib; ALIAS; CFSQP
Cited in: 16 Publications

Standard Articles

1 Publication describing the Software, including 1 Publication in zbMATH Year
ICOS: a branch and bound based solver for rigorous global optimization. Zbl 1179.90265
Lebbah, Y.
2009

Citations by Year