[Bonmin] stopping Bonmin

[Pierre Bonami]

Hi,

>
> Someone correct me if I'm wrong, but I think Bonmin does not enforce the
> timelimit during the Ipopt run.

No you are right. Even though there is an option in Ipopt it is not so
simple as Cbc does not check for it (it will consider sub-problem finished
due to time limit as infeasible).
Cheers,
Pierre

>
> But there is a new Ipopt option to limit the time:
> http://www.coin-or.org/Ipopt/documentation/node70.html
> Does it help when you add a
> max_cpu_time 1
> to your option file (without "bonmin."-prefix) ?
>
> Stefan
>
> >
> > Many many thanks
> >
> > giuseppe
> >
> >
> > WARNING: Tried to set option "print_level" to a value of "1",
> >          but the previous value is set to disallow clobbering.
> >          The setting will remain as: "print_level 6"
> >
> > List of options:
> >
> >                                     Name   Value                # times
> used
> >                         bonmin.algorithm = B-BB                      1
> >                      bonmin.bb_log_level = 4                         2
> >                   bonmin.iteration_limit = 10                        1
> >               bonmin.number_before_trust = 1                         0
> >              bonmin.number_strong_branch = 1000                      0
> >                        bonmin.time_limit = 1                         1
> >                bonmin.variable_selection = nlp-strong-branching      0
> >                expect_infeasible_problem = yes                       2
> >                                gamma_phi = 1e-08                     1
> >                              gamma_theta = 0.0001                    1
> >                                mu_oracle = probing                   2
> >                              mu_strategy = adaptive                  2
> >                              print_level = 6                         3
> >                           print_solution = yes                       1
> >         required_infeasibility_reduction = 0.1                       0
> >
> >
> ******************************************************************************
> > This program contains Ipopt, a library for large-scale nonlinear
> optimization.
> >  Ipopt is released as open source code under the Common Public License
> (CPL).
> >          For more information visit http://projects.coin-or.org/Ipopt
> >
> ******************************************************************************
> >
> > NOTE: You are using Ipopt by default with the MUMPS linear solver.
> >       Other linear solvers might be more efficient (see Ipopt
> documentation).
> >
> >
> > This is Ipopt version 3.6stable, running with linear solver mumps.
> >
> > Number of nonzeros in equality constraint Jacobian...:    10581
> > Number of nonzeros in inequality constraint Jacobian.:     1684
> > Number of nonzeros in Lagrangian Hessian.............:     1440
> >
> > Scaling parameter for objective function = 1.000000e+00
> > Equality constraints are scaled with smallest scaling parameter is
> 1.000000e-01
> > Inequality constraints are not scaled.
> > Moved initial values of x sufficiently inside the bounds.
> >
> >
> >
> ....................................................................................
> >
> ....................................................................................
> >
> ....................................................................................
> >
> ....................................................................................
> >
> ....................................................................................
> >
> ....................................................................................
> >
> ....................................................................................
> >
> ....................................................................................
> >
> ....................................................................................
> >
> ....................................................................................
> >
> >
> >
> >  **************************************************
> > *** Update HessianMatrix for Iteration 138:
> > **************************************************
> >
> >
> >
> > **************************************************
> > *** Summary of Iteration: 138:
> > **************************************************
> >
> > iter    objective    inf_pr   inf_du lg(mu)  ||d||  lg(rg) alpha_du
> alpha_pr  ls
> >  138 -6.7209529e+01 3.64e-02 2.18e+06   1.0 9.05e-01   5.4 1.81e-01
> > 1.07e-01h  1 Fl
> >
> > **************************************************
> > *** Beginning Iteration 138 from the following point:
> > **************************************************
> >
> > Current barrier parameter mu = 1.0903679534902398e+01
> > Current fraction-to-the-boundary parameter tau = 9.8999999999999999e-01
> >
> > ||curr_x||_inf   = 1.9661942024696255e+05
> > ||curr_s||_inf   = 1.2178079283934749e+04
> > ||curr_y_c||_inf = 2.6443132699285839e+07
> > ||curr_y_d||_inf = 1.2624137038804408e+07
> > ||curr_z_L||_inf = 5.3355026600588057e+06
> > ||curr_z_U||_inf = 2.2719144233394220e+07
> > ||curr_v_L||_inf = 1.0903812213355341e-08
> > ||curr_v_U||_inf = 1.0900972670818821e+07
> >
> >
> > ***Current NLP Values for Iteration 138:
> >
> >                                    (scaled)                 (unscaled)
> > Objective...............:  -6.7209528968436345e+01
> -6.7209528968436345e+01
> > Dual infeasibility......:   2.1777462890798487e+06
>  2.1777462890798487e+06
> > Constraint violation....:   3.6405018980666198e-02
>  9.8824327150319968e-02
> > Complementarity.........:   1.8107150690355127e+02
>  1.8107150690355127e+02
> > Overall NLP error.......:   6.6624480905292455e+02
>  2.1777462890798487e+06
> >
> >
> >
> >
> > **************************************************
> > *** Update Barrier Parameter for Iteration 138:
> > **************************************************
> >
> > Remaining in fixed mu mode.
> > Barrier Parameter: 1.090368e+01
> >
> > **************************************************
> > *** Solving the Primal Dual System for Iteration 138:
> > **************************************************
> >
> > Number of doubles for MUMPS to hold factorization (INFO(9)) = 253214
> > Number of integers for MUMPS to hold factorization (INFO(10)) = 142227
> > In MumpsSolverInterface::Factorization: negevals_ = 3903, but
> > numberOfNegEVals = 3353
> > Factorization failed with retval = 2
> > Number of doubles for MUMPS to hold factorization (INFO(9)) = 129365
> > Number of integers for MUMPS to hold factorization (INFO(10)) = 138707
> > In MumpsSolverInterface::Factorization: negevals_ = 3354, but
> > numberOfNegEVals = 3353
> > Factorization failed with retval = 2
> > Number of doubles for MUMPS to hold factorization (INFO(9)) = 129365
> > Number of integers for MUMPS to hold factorization (INFO(10)) = 138707
> >
> >
> > real    2m40.741s
> > user    1m46.039s
> > sys     0m1.736s
> >
> > _______________________________________________
> > Bonmin mailing list
> > Bonmin at list.coin-or.org
> > http://list.coin-or.org/mailman/listinfo/bonmin
> >
>
> _______________________________________________
> Bonmin mailing list
> Bonmin at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/bonmin
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://list.coin-or.org/pipermail/bonmin/attachments/20090704/76bbece5/attachment-0001.html