[Couenne-tickets] [Couenne, a solver for non-convex MINLP problems] #4: balanced branching strategies in non-convex univariate functions

[Couenne, a solver for non-convex MINLP problems]

#4: balanced branching strategies in non-convex univariate functions
--------------------------------------------+-------------------------------
 Reporter:  pbelotti                        |       Owner:  pbelotti
     Type:  defect                          |      Status:  new     
 Priority:  major                           |   Milestone:          
Component:  component1                      |     Version:          
 Keywords:  branching, balanced, odd power  |  
--------------------------------------------+-------------------------------
 The balanced branching strategy might use wrong values or raise math
 exceptions when branching on odd power operators. In minMaxDelta.cpp,
 computing curvDistance() does not take into account the fact that

 1) there can be two result of the inverse of a derivative (FpInv()), which
 is a square root in the case that the function is x^3

 2) the resulting approximation of subproblem area for one of the two
 branches is erroneous.

 Until this ticket is closed, it is suggested that the branching strategy
 to be used is the default, and can be set with

 branch_pt_select mid-point

 in the couenne.opt option file.

-- 
Ticket URL: <https://projects.coin-or.org/Couenne/ticket/4>
Couenne, a solver for non-convex MINLP problems <https://projects.coin-or.org/Couenne>
Couenne, a solver for non-convex MINLP problems