| a33623b | Gilles Chabert | 10 January 2013, 13:31:12 UTC | Creating release 1.21 | 10 January 2013, 13:31:12 UTC |
| fe8680f | Bertrand Neveu | 07 November 2012, 19:09:52 UTC | soplex on mac 64 bits | 07 November 2012, 19:09:52 UTC |
| 30efdf2 | Bertrand Neveu | 07 November 2012, 19:08:14 UTC | BiasProfil on MAC 64 bits | 07 November 2012, 19:08:14 UTC |
| 95d20a9 | Bertrand Neveu | 07 November 2012, 13:50:18 UTC | bug correction IbexAffineSimplex.cpp | 07 November 2012, 13:50:18 UTC |
| bf34394 | Bertrand Neveu | 18 October 2012, 09:07:26 UTC | bug fixed in AA_Simplex constructor in management of goal_ctr in case of CSP | 18 October 2012, 09:07:26 UTC |
| ba30e1c | Ignacio Araya | 17 October 2012, 20:58:12 UTC | Arithmetic affine: bug fixed (losing of solutions) | 17 October 2012, 20:58:12 UTC |
| 39f0e51 | Bertrand Neveu | 12 October 2012, 14:02:05 UTC | max_diam_box added in IbexAffineSimplex.h | 12 October 2012, 14:02:05 UTC |
| 2eccaeb | Bertrand Neveu | 11 October 2012, 09:01:47 UTC | end of affine arithmetics merge; max_diam_box in LR_contractor | 11 October 2012, 09:01:47 UTC |
| 9e6f211 | Gilles Chabert | 11 October 2012, 07:00:45 UTC | Merge tags/ibex-1.20 ---> trunk | 11 October 2012, 07:00:45 UTC |
| c0e40ca | Ignacio Araya | 22 August 2012, 18:16:19 UTC | I implemented an Affine Arithmetic based contractor (AA_Simplex) based on the work of J. Ninin, F. Messine and P. Hansen. AA_Simplex is a subclass of LR_contractor | 22 August 2012, 18:16:19 UTC |
| 1854e0b | Ignacio Araya | 20 August 2012, 15:58:56 UTC | I split the XNewton class in two: LR_contractor (linear relaxation based contractor) and XNewton. XNewton is now a subclass of LR_contractor. Eventually I will implement the AF2 contractor that will be also a subclass of LR_contractor | 20 August 2012, 15:58:56 UTC |
| 7994d4c | Ignacio Araya | 20 August 2012, 15:55:31 UTC | I split the XNewton class in two: LR_contractor (linear relaxation based contractor) and XNewton. XNewton is now a subclass of LR_contractor. Eventually I will implement the AF2 contractor that will be also a subclass of LR_contractor | 20 August 2012, 15:55:31 UTC |
| 9fb442b | Bertrand Neveu | 17 July 2012, 09:42:58 UTC | passage de uplo en public pour le restart | 17 July 2012, 09:42:58 UTC |
| eba8669 | Bertrand Neveu | 27 June 2012, 14:01:00 UTC | ajout des fichiers ACID | 27 June 2012, 14:01:00 UTC |
| 4fc1e2b | Bertrand Neveu | 26 June 2012, 08:00:26 UTC | rattrapage erreur updateloup ; correction bug maj uplo: ajout traces optim | 26 June 2012, 08:00:26 UTC |
| d5bfe3e | Gilles Chabert | 11 June 2012, 08:35:17 UTC | Creation ibex-1.20 | 11 June 2012, 08:35:17 UTC |
| 810b177 | Gilles Chabert | 11 June 2012, 08:09:39 UTC | Merging with branch/optim | 11 June 2012, 08:09:39 UTC |
| e547123 | Gilles Chabert | 11 June 2012, 07:53:23 UTC | Final merge of trunk changes before reintegration | 11 June 2012, 07:53:23 UTC |
| 627c805 | Gilles Chabert | 11 June 2012, 07:46:54 UTC | Suppress -g option in src/makefile Suppress "mutable os" in OperatorPrinter | 11 June 2012, 07:46:54 UTC |
| 39dd4a4 | Ignacio Araya | 19 April 2012, 22:58:05 UTC | Fixed bug related to Amohc | 19 April 2012, 22:58:05 UTC |
| 6af13a1 | Ignacio Araya | 13 April 2012, 18:13:32 UTC | InnerProjections: for multiplication and divisions, maximal boxes are found when 0 in [z] (considering the constraints x*y in [z] or x/y in [z]) | 13 April 2012, 18:13:32 UTC |
| afd9e9a | Bertrand Neveu | 29 March 2012, 12:24:28 UTC | divers ajouts : stats sur le loup, constructeur Optimizer avec Precision ... | 29 March 2012, 12:24:28 UTC |
| f1b22db | Ignacio Araya | 20 March 2012, 19:48:50 UTC | new version of Mohc. Changes:\n * MonotonicBoxNarrow includes the variables generated by OG. \n * Providing a value for tau_mohc, Mohc may decide, incrementally, which constraints to treat with the 'monotonic procedures' \n * Amohc \n * MohcAll is still compatible with the new version (requires some tests) | 20 March 2012, 19:48:50 UTC |
| 390df70 | Gilles Chabert | 18 March 2012, 09:31:31 UTC | Correction bug Hull | 18 March 2012, 09:31:31 UTC |
| bdb2b1f | Bertrand Neveu | 13 January 2012, 15:50:52 UTC | ajout exception CellLimitException ; suite menage code optim | 13 January 2012, 15:50:52 UTC |
| 093cb32 | Bertrand Neveu | 10 January 2012, 15:44:08 UTC | remise de fichiers bidons IbexSimplex.h et IbexUpdateLoup.h pour compiler | 10 January 2012, 15:44:08 UTC |
| a10705e | Bertrand Neveu | 10 January 2012, 15:08:22 UTC | suite et fin? ménage code optim | 10 January 2012, 15:08:22 UTC |
| 0f0d50e | Bertrand Neveu | 16 December 2011, 15:36:53 UTC | menage dans code et commentaires apres introduction optim sans contraintes | 16 December 2011, 15:36:53 UTC |
| 8c5a1a7 | Bertrand Neveu | 15 December 2011, 13:09:07 UTC | class ConstrainedOptimizer created , class Optimizer used for unconstrained optimization, update_loup and simplex_update_loup integrated into class Optimizer | 15 December 2011, 13:09:07 UTC |
| 736af0e | Ignacio Araya | 05 November 2011, 15:38:29 UTC | I added a new heuristic for coin selection: K4. It generates 4 equidistant coins (if n%3==0) | 05 November 2011, 15:38:29 UTC |
| d0f2497 | Bertrand Neveu | 20 October 2011, 08:40:02 UTC | ajout de max_diam_box dans X_Newton pour régler un bug de soplex en empêchant son appel sur des grandes boîtes | 20 October 2011, 08:40:02 UTC |
| 622d7f3 | Bertrand Neveu | 23 June 2011, 15:16:56 UTC | remise makefile optim | 23 June 2011, 15:16:56 UTC |
| 00b2d26 | Gilles Chabert | 23 June 2011, 13:14:24 UTC | Bug fix "sandalone_paver" trunk -> optim | 23 June 2011, 13:14:24 UTC |
| ae68f47 | Gilles Chabert | 23 June 2011, 13:11:14 UTC | Bug fix standalone_paver | 23 June 2011, 13:11:14 UTC |
| c843ced | Gilles Chabert | 21 June 2011, 20:03:55 UTC | Merged latest trunk changes | 21 June 2011, 20:03:55 UTC |
| 73d2112 | Bertrand Neveu | 20 June 2011, 09:50:00 UTC | catch error UnboundedResultException dans IbexXNewton.h + heuristique sur objectif monotone MONO | 20 June 2011, 09:50:00 UTC |
| 1b5d8a0 | Bertrand Neveu | 20 May 2011, 16:05:22 UTC | correction incrementalite Mohc_All | 20 May 2011, 16:05:22 UTC |
| f793c29 | Gilles Chabert | 07 May 2011, 14:07:40 UTC | Bug n°3298698 fixed. | 07 May 2011, 14:07:40 UTC |
| a49f8da | Bertrand Neveu | 06 May 2011, 08:42:45 UTC | correction greedy+neg | 06 May 2011, 08:42:45 UTC |
| f0377ec | Bertrand Neveu | 18 April 2011, 13:25:36 UTC | modif X_Newton iter | 18 April 2011, 13:25:36 UTC |
| 5b6be72 | Bertrand Neveu | 14 April 2011, 15:14:16 UTC | implementation of Achterberg heuristic in XNewton | 14 April 2011, 15:14:16 UTC |
| 0e66553 | Gilles Chabert | 14 April 2011, 13:21:14 UTC | Constraint::is_equality returns "false" by default (no more pure virtual) | 14 April 2011, 13:21:14 UTC |
| 58b4531 | Gilles Chabert | 14 April 2011, 13:09:42 UTC | An exception is thrown now when an empty space is synchronized in "UNION" mode | 14 April 2011, 13:09:42 UTC |
| d0d2128 | Gilles Chabert | 14 April 2011, 12:10:05 UTC | Bug fix in INTERVAL_VECTOR: the result of x&=y was true when y was the empty interval vector. | 14 April 2011, 12:10:05 UTC |
| 80c5efe | Gilles Chabert | 14 April 2011, 10:13:52 UTC | Bug fix in INTERVAL: the result of x&=y was true when y was the empty interval. | 14 April 2011, 10:13:52 UTC |
| 15377c3 | Gilles Chabert | 14 April 2011, 08:15:51 UTC | New function: size(int blk) in BlockSet | 14 April 2011, 08:15:51 UTC |
| 8f6d2e2 | Ignacio Araya | 13 April 2011, 14:15:38 UTC | New corner heuristic (BEST) for taylorization | 13 April 2011, 14:15:38 UTC |
| 9170acc | Gilles Chabert | 12 April 2011, 16:04:26 UTC | Bug n°3285360 fixed | 12 April 2011, 16:04:26 UTC |
| 5084753 | Bertrand Neveu | 12 April 2011, 12:10:41 UTC | correction bug negrand; baharev optimization | 12 April 2011, 12:10:41 UTC |
| dabed71 | Bertrand Neveu | 16 March 2011, 09:59:13 UTC | catch UnboundedResultException in calls to gradient | 16 March 2011, 09:59:13 UTC |
| e9f1be6 | Ignacio Araya | 14 March 2011, 18:54:01 UTC | Two small optimizations for XNewton: \n -when two or more heuristics for selecting coins are used, linear constraints are added only once. \n -linear constraints are linearized using Taylor (even when Hansen has been specified) | 14 March 2011, 18:54:01 UTC |
| 358562c | Ignacio Araya | 07 March 2011, 18:54:46 UTC | Implementation of X-Newton. | 07 March 2011, 18:54:46 UTC |
| 767b5df | Ignacio Araya | 22 February 2011, 17:46:32 UTC | Implementation of two new methods using Simplex. The methods perform the lower and upper bounding by using a linear relaxation generated from a heuristically chosen point (instead of the arbitrary point inf([x])) | 22 February 2011, 17:46:32 UTC |
| e43583c | Gilles Chabert | 18 February 2011, 11:38:59 UTC | Bug 3160617 fixed. When indices in constraint or contrator lists exceed size, the error is now properly handled (instead of seg fault) Also minor corrections on comments (Interval.h and IbexOperator.h) The option -stdc++ added for 2Dviewer in quimper | 18 February 2011, 11:38:59 UTC |
| ce3c8bb | Bertrand Neveu | 17 February 2011, 10:24:35 UTC | correction louppoint(n) <- loup | 17 February 2011, 10:24:35 UTC |
| 2fb6465 | Bertrand Neveu | 11 February 2011, 10:25:26 UTC | bug fix: 3162702 | 11 February 2011, 10:25:26 UTC |
| b71f3f3 | Gilles Chabert | 26 January 2011, 09:03:51 UTC | Add is_contractor_node function in IbexPaving Add contrib package in the makefile | 26 January 2011, 09:03:51 UTC |
| 0094702 | Ignacio Araya | 24 January 2011, 15:58:43 UTC | catch of EmptyBoxException when a point is been evaluated | 24 January 2011, 15:58:43 UTC |
| e377df2 | Ignacio Araya | 24 January 2011, 15:36:53 UTC | | 24 January 2011, 15:36:53 UTC |
| b24a2da | Ignacio Araya | 21 January 2011, 21:43:47 UTC | 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(); // } // //================================================= | 21 January 2011, 21:43:47 UTC |
| b5c49a9 | Ignacio Araya | 21 January 2011, 04:46:11 UTC | 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. | 21 January 2011, 04:46:11 UTC |
| 4c34bc6 | Ignacio Araya | 20 January 2011, 21:21:24 UTC | implementation of inflation | 20 January 2011, 21:21:24 UTC |
| c354d36 | Ignacio Araya | 20 January 2011, 15:41:57 UTC | repaired bug in simplex_lower_bounding method | 20 January 2011, 15:41:57 UTC |
| a4dbf6d | Ignacio Araya | 20 January 2011, 03:04:52 UTC | correction of multiples errors in IbexSimplex.cpp | 20 January 2011, 03:04:52 UTC |
| caf62d7 | Gilles Chabert | 19 January 2011, 16:30:42 UTC | Little improvement on inverse (IbexOptimizer.cpp) On construisait les HC4Revise sans leur passer l'espace du système. Ce n'est plus le cas | 19 January 2011, 16:30:42 UTC |
| 89fdfa5 | Gilles Chabert | 19 January 2011, 14:38:05 UTC | Small update UpdateLoup Introducing a variable loup_changed instead of returning directly false/true | 19 January 2011, 14:38:05 UTC |
| 9fbb6c7 | Ignacio Araya | 19 January 2011, 13:38:31 UTC | bug correction | 19 January 2011, 13:38:31 UTC |
| b2a8c74 | Ignacio Araya | 19 January 2011, 13:18:19 UTC | last version of innerprojections | 19 January 2011, 13:18:19 UTC |
| 5f7c31e | Bertrand Neveu | 19 January 2011, 11:23:03 UTC | new version InnerProjections + bug correction check_candidate | 19 January 2011, 11:23:03 UTC |
| 5321dec | Ignacio Araya | 18 January 2011, 10:55:15 UTC | 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). | 18 January 2011, 10:55:15 UTC |
| 3b02631 | Bertrand Neveu | 17 January 2011, 13:40:09 UTC | trace message suppression | 17 January 2011, 13:40:09 UTC |
| 02db290 | Bertrand Neveu | 17 January 2011, 13:34:23 UTC | bug correction in line_probing | 17 January 2011, 13:34:23 UTC |
| 7386e3e | Gilles Chabert | 17 January 2011, 09:23:08 UTC | Ajout de la boîte intérieure dans une structure backtrackable. Il reste à exploiter cette boîte en entrée du inHC4. | 17 January 2011, 09:23:08 UTC |
| 5ca4950 | Gilles Chabert | 16 January 2011, 21:42:43 UTC | - 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. | 16 January 2011, 21:42:43 UTC |
| e33e971 | Gilles Chabert | 16 January 2011, 00:21:16 UTC | Removing resultats6210 | 16 January 2011, 00:21:16 UTC |
| fa7e5fa | Gilles Chabert | 16 January 2011, 00:19:53 UTC | Integration of Bertrand's last version (14 Jan 2011) | 16 January 2011, 00:19:53 UTC |
| c8337f5 | Gilles Chabert | 16 January 2011, 00:11:56 UTC | Creation of the optimization branch | 16 January 2011, 00:11:56 UTC |
| 61423d8 | Gilles Chabert | 15 January 2011, 23:35:19 UTC | initial import 1.19 | 15 January 2011, 23:35:19 UTC |
