initial import 1.19

git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/trunk@1 dc7de15e-2914-4126-ad85-3d0db18f7245
Creation of the optimization branch



git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@3 dc7de15e-2914-4126-ad85-3d0db18f7245
Integration of Bertrand's last version (14 Jan 2011)



git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@4 dc7de15e-2914-4126-ad85-3d0db18f7245
Removing resultats6210



git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@5 dc7de15e-2914-4126-ad85-3d0db18f7245
- Création de plusieurs méthodes de probing
  - "random_probing": version de base refactorée
  - "line_probing": sorte de descente de gradient simplifiée qui peut fonctionner 
                    également en récursif (=> recalcul du gradient si loup modifié).
Une fois un point x identifié comme candidat, on appelle désormais la fonction "check_candidate" qui se charge 
de tester si f(x)<loup.

- Suppression de "isInner" qui faisait (en moins efficace) la même chose que le contracteur "is_inside"

- On ne s'arrête plus une fois que le loup est diminué dans UpdateLoup, on essaye 
systématiquement "nb_samples" point.



git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@6 dc7de15e-2914-4126-ad85-3d0db18f7245
Ajout de la boîte intérieure dans une structure backtrackable.

Il reste à exploiter cette boîte en entrée du inHC4.



git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@7 dc7de15e-2914-4126-ad85-3d0db18f7245
bug correction in line_probing

git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@8 dc7de15e-2914-4126-ad85-3d0db18f7245
trace message suppression 

git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@9 dc7de15e-2914-4126-ad85-3d0db18f7245
I added a library called Soplex that implements the Simplex algorithm. 
This library is used by 2 new files: IbexSimplex.cpp and IbexSimplex.h.
I implemented two new methods for contracting [y]: 
-simplex_lower_bounding (unreliable)
-simplex_update_loup
both of them do a linear relaxation of the system and perform the simplex algorithm
for improving y_inf and y_sup respectively. simplex_lower_bounding can be not conservative (unreliable).




git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@10 dc7de15e-2914-4126-ad85-3d0db18f7245
new version InnerProjections  +  bug correction check_candidate 

git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@11 dc7de15e-2914-4126-ad85-3d0db18f7245
last version of innerprojections

git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@12 dc7de15e-2914-4126-ad85-3d0db18f7245
bug correction

git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@13 dc7de15e-2914-4126-ad85-3d0db18f7245
Small update UpdateLoup

Introducing a variable loup_changed instead of returning directly false/true



git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@14 dc7de15e-2914-4126-ad85-3d0db18f7245
Little improvement on inverse (IbexOptimizer.cpp)

On construisait les HC4Revise sans leur passer l'espace du système.
Ce n'est plus le cas




git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@15 dc7de15e-2914-4126-ad85-3d0db18f7245
correction of multiples errors in IbexSimplex.cpp

git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@16 dc7de15e-2914-4126-ad85-3d0db18f7245
repaired bug in simplex_lower_bounding method

git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@17 dc7de15e-2914-4126-ad85-3d0db18f7245
implementation of inflation

git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@18 dc7de15e-2914-4126-ad85-3d0db18f7245
more bugs repaired. To avoid problems with SoPleX, if the derivatives of the constraints are greater than 1e8, then the box may be not treated by the Simplex algorithm.

git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@19 dc7de15e-2914-4126-ad85-3d0db18f7245
Bugs of Inflation and IbexSimplex fixed.

- I readd the isInner method in the class IbexUpdateLoup. As before, this method returns true if, in a constraint g(x)<=0, the natural evaluation of the current box [x] is less than or EQUAL TO 0. I need it to verify if the inflation, and innerprojections are returning innerboxes. In some cases the evaluation of vertices in the innerbox is equal to 0.
- I added a commented procedure in the update_loup method. If it is uncommented, this procedure expands the current innerbox. 

//   //=============the innerbox expansion==============
//     if(!innerfound && !inner_box.empty()){
//         inner_box(sys.nb_var())=INTERVAL(-1e8,1e8);
//         if(inner_box&=sys.space.box){
//           inHC4_expand(sys, inner_box);
//           sys.space.box=inner_box;
//           innerfound=true;
//         }else 
//           inner_box.set_empty();
//    }
//    //=================================================


git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@20 dc7de15e-2914-4126-ad85-3d0db18f7245
git-svn-id: http://svn.code.sf.net/p/ibex-lib/code/branches/optim@21 dc7de15e-2914-4126-ad85-3d0db18f7245