Changeset 1991


Ignore:
Timestamp:
Jun 4, 2012 8:18:34 AM (7 years ago)
Author:
pbonami
Message:

Update doc

Location:
trunk/Bonmin
Files:
6 edited

Legend:

Unmodified
Added
Removed
  • trunk/Bonmin/doc/options_list_bonmin_content.tex

    r1642 r1991  
    99<td> B-QG</td>
    1010<td> B-Hyb</td>
    11 <td> B-Ecp</td>
    12 <td> B-iFP</td>
    13 <td> Cbc_D</td>
    1411</tr>
    1512<tr>   <th colspan=9> <a href="#sec:Algorithm_choice">Algorithm choice</a> </th>
     
    2219<td>+</td>
    2320<td>+</td>
    24 <td>+</td>
    25 <td>+</td>
    26 <td>+</td>
    2721</tr>
    2822<tr>   <th colspan=9> <a href="#sec:Branch-and-bound_options">Branch-and-bound options</a> </th>
     
    3529<td>+</td>
    3630<td>+</td>
    37 <td>+</td>
    38 <td>+</td>
    39 <td>+</td>
    4031</tr>
    4132<tr>
     
    4637<td>+</td>
    4738<td>+</td>
    48 <td>+</td>
    49 <td>+</td>
    50 <td>+</td>
    5139</tr>
    5240<tr>
     
    5745<td>+</td>
    5846<td>+</td>
    59 <td>+</td>
    60 <td>+</td>
    61 <td>+</td>
    6247</tr>
    6348<tr>
     
    6853<td>+</td>
    6954<td>+</td>
    70 <td>+</td>
    71 <td>+</td>
    72 <td>+</td>
    7355</tr>
    7456<tr>
    7557<td> <a href="#sec:enable_dynamic_nlp">enable_dynamic_nlp</a> </td>
    7658<td>S</td>
    77 <td> -</td>
    78 <td>-</td>
    79 <td>+</td>
    80 <td>+</td>
    81 <td>+</td>
     59<td> +</td>
     60<td>-</td>
    8261<td>-</td>
    8362<td>-</td>
     
    9069<td>+</td>
    9170<td>+</td>
    92 <td>+</td>
    93 <td>+</td>
    94 <td>+</td>
    9571</tr>
    9672<tr>
     
    10177<td>+</td>
    10278<td>+</td>
    103 <td>+</td>
    104 <td>+</td>
    105 <td>+</td>
    10679</tr>
    10780<tr>
     
    11285<td>-</td>
    11386<td>-</td>
    114 <td>-</td>
    115 <td>-</td>
    116 <td>-</td>
    11787</tr>
    11888<tr>
     
    12393<td>+</td>
    12494<td>+</td>
    125 <td>+</td>
    126 <td>+</td>
    127 <td>-</td>
    12895</tr>
    12996<tr>
     
    134101<td>+</td>
    135102<td>+</td>
    136 <td>+</td>
    137 <td>+</td>
    138 <td>+</td>
    139103</tr>
    140104<tr>
     
    145109<td>+</td>
    146110<td>+</td>
    147 <td>+</td>
    148 <td>-</td>
    149 <td>-</td>
    150111</tr>
    151112<tr>
     
    156117<td>+</td>
    157118<td>+</td>
    158 <td>+</td>
    159 <td>-</td>
    160 <td>-</td>
    161119</tr>
    162120<tr>
     
    167125<td>+</td>
    168126<td>+</td>
    169 <td>+</td>
    170 <td>+</td>
    171 <td>+</td>
    172127</tr>
    173128<tr>
     
    178133<td>+</td>
    179134<td>+</td>
     135</tr>
     136<tr>
     137<td> <a href="#sec:random_generator_seed">random_generator_seed</a> </td>
     138<td>I</td>
     139<td> +</td>
     140<td>+</td>
     141<td>+</td>
     142<td>+</td>
     143</tr>
     144<tr>
     145<td> <a href="#sec:read_solution_file">read_solution_file</a> </td>
     146<td>S</td>
     147<td> +</td>
    180148<td>+</td>
    181149<td>+</td>
     
    189157<td>+</td>
    190158<td>+</td>
    191 <td>+</td>
    192 <td>+</td>
    193 <td>+</td>
    194159</tr>
    195160<tr>
     
    200165<td>+</td>
    201166<td>+</td>
    202 <td>+</td>
    203 <td>+</td>
    204 <td>-</td>
    205167</tr>
    206168<tr>
     
    211173<td>+</td>
    212174<td>+</td>
    213 <td>+</td>
    214 <td>+</td>
    215 <td>+</td>
    216175</tr>
    217176<tr>
     
    222181<td>+</td>
    223182<td>+</td>
    224 <td>+</td>
    225 <td>+</td>
    226 <td>-</td>
    227183</tr>
    228184<tr>
     
    231187<td> +</td>
    232188<td>-</td>
    233 <td>-</td>
    234 <td>-</td>
    235 <td>-</td>
    236 <td>-</td>
    237 <td>-</td>
     189<td>+</td>
     190<td>+</td>
    238191</tr>
    239192<tr>   <th colspan=9> <a href="#sec:MILP_cutting_planes_in_hybrid">MILP cutting planes in hybrid</a> </th>
     
    246199<td>+</td>
    247200<td>+</td>
    248 <td>+</td>
    249 <td>+</td>
    250 <td>+</td>
    251201</tr>
    252202<tr>
     
    257207<td>+</td>
    258208<td>+</td>
    259 <td>+</td>
    260 <td>+</td>
    261 <td>+</td>
    262209</tr>
    263210<tr>
     
    268215<td>+</td>
    269216<td>+</td>
    270 <td>+</td>
    271 <td>+</td>
    272 <td>+</td>
    273217</tr>
    274218<tr>
     
    279223<td>+</td>
    280224<td>+</td>
    281 <td>+</td>
    282 <td>+</td>
    283 <td>+</td>
    284225</tr>
    285226<tr>
     
    290231<td>+</td>
    291232<td>+</td>
    292 <td>+</td>
    293 <td>+</td>
    294 <td>+</td>
    295233</tr>
    296234<tr>
     
    301239<td>+</td>
    302240<td>+</td>
    303 <td>+</td>
    304 <td>+</td>
    305 <td>+</td>
    306241</tr>
    307242<tr>
     
    312247<td>+</td>
    313248<td>+</td>
    314 <td>+</td>
    315 <td>+</td>
    316 <td>+</td>
    317249</tr>
    318250<tr>
     
    323255<td>+</td>
    324256<td>+</td>
    325 <td>+</td>
    326 <td>+</td>
    327 <td>+</td>
    328257</tr>
    329258<tr>   <th colspan=9> <a href="#sec:MINLP_Heuristics">MINLP Heuristics</a> </th>
     
    336265<td>+</td>
    337266<td>+</td>
    338 <td>+</td>
    339 <td>+</td>
    340 <td>-</td>
    341267</tr>
    342268<tr>
     
    347273<td>+</td>
    348274<td>+</td>
    349 <td>+</td>
    350 <td>+</td>
    351 <td>-</td>
     275</tr>
     276<tr>
     277<td> <a href="#sec:heuristic_dive_MIP_fractional">heuristic_dive_MIP_fractional</a> </td>
     278<td>S</td>
     279<td> +</td>
     280<td>+</td>
     281<td>+</td>
     282<td>+</td>
    352283</tr>
    353284<tr>
     
    358289<td>+</td>
    359290<td>+</td>
    360 <td>+</td>
    361 <td>+</td>
    362 <td>-</td>
    363291</tr>
    364292<tr>
     
    369297<td>+</td>
    370298<td>+</td>
    371 <td>+</td>
    372 <td>+</td>
    373 <td>-</td>
    374299</tr>
    375300<tr>
     
    380305<td>+</td>
    381306<td>+</td>
    382 <td>+</td>
    383 <td>+</td>
    384 <td>-</td>
    385307</tr>
    386308<tr>
     
    391313<td>+</td>
    392314<td>+</td>
    393 <td>+</td>
    394 <td>+</td>
    395 <td>-</td>
    396315</tr>
    397316<tr>
     
    402321<td>+</td>
    403322<td>+</td>
    404 <td>+</td>
    405 <td>+</td>
    406 <td>-</td>
    407 </tr>
    408 <tr>   <th colspan=9> <a href="#sec:MINLP_heuristics">MINLP heuristics</a> </th>
    409 </tr>
    410 <tr>
    411 <td> <a href="#sec:heuristic_dive_MIP_fractional">heuristic_dive_MIP_fractional</a> </td>
    412 <td>S</td>
    413 <td> +</td>
    414 <td>+</td>
    415 <td>+</td>
    416 <td>+</td>
    417 <td>+</td>
    418 <td>+</td>
    419 <td>-</td>
    420323</tr>
    421324<tr>   <th colspan=9> <a href="#sec:Nlp_solution_robustness">Nlp solution robustness</a> </th>
     
    428331<td>-</td>
    429332<td>-</td>
    430 <td>-</td>
    431 <td>-</td>
    432 <td>-</td>
    433333</tr>
    434334<tr>
     
    439339<td>-</td>
    440340<td>-</td>
    441 <td>-</td>
    442 <td>-</td>
    443 <td>-</td>
    444341</tr>
    445342<tr>
     
    450347<td>+</td>
    451348<td>+</td>
    452 <td>+</td>
    453 <td>+</td>
    454 <td>+</td>
    455349</tr>
    456350<tr>
     
    461355<td>+</td>
    462356<td>+</td>
    463 <td>+</td>
    464 <td>+</td>
    465 <td>+</td>
    466357</tr>
    467358<tr>
     
    472363<td>-</td>
    473364<td>-</td>
    474 <td>-</td>
    475 <td>-</td>
    476 <td>-</td>
    477365</tr>
    478366<tr>
     
    483371<td>-</td>
    484372<td>-</td>
    485 <td>-</td>
    486 <td>-</td>
    487 <td>-</td>
     373</tr>
     374<tr>
     375<td> <a href="#sec:resolve_on_small_infeasibility">resolve_on_small_infeasibility</a> </td>
     376<td>F</td>
     377<td> +</td>
     378<td>+</td>
     379<td>+</td>
     380<td>+</td>
    488381</tr>
    489382<tr>   <th colspan=9> <a href="#sec:Nlp_solve_options_in_B-Hyb">Nlp solve options in B-Hyb</a> </th>
     
    496389<td>-</td>
    497390<td>+</td>
    498 <td>-</td>
    499 <td>-</td>
    500 <td>-</td>
    501391</tr>
    502392<tr>
     
    507397<td>-</td>
    508398<td>+</td>
    509 <td>-</td>
    510 <td>-</td>
    511 <td>-</td>
    512399</tr>
    513400<tr>
     
    518405<td>-</td>
    519406<td>+</td>
    520 <td>-</td>
    521 <td>-</td>
    522 <td>-</td>
    523407</tr>
    524408<tr>   <th colspan=9> <a href="#sec:Options_for_MILP_solver">Options for MILP solver</a> </th>
    525409</tr>
    526410<tr>
     411<td> <a href="#sec:cpx_parallel_strategy">cpx_parallel_strategy</a> </td>
     412<td>I</td>
     413<td> -</td>
     414<td>-</td>
     415<td>-</td>
     416<td>-</td>
     417</tr>
     418<tr>
    527419<td> <a href="#sec:milp_log_level">milp_log_level</a> </td>
    528420<td>I</td>
     
    531423<td>-</td>
    532424<td>-</td>
    533 <td>-</td>
    534 <td>-</td>
    535 <td>+</td>
    536425</tr>
    537426<tr>
     
    542431<td>-</td>
    543432<td>-</td>
    544 <td>-</td>
    545 <td>-</td>
    546 <td>+</td>
     433</tr>
     434<tr>
     435<td> <a href="#sec:milp_strategy">milp_strategy</a> </td>
     436<td>S</td>
     437<td> -</td>
     438<td>-</td>
     439<td>-</td>
     440<td>-</td>
     441</tr>
     442<tr>
     443<td> <a href="#sec:number_cpx_threads">number_cpx_threads</a> </td>
     444<td>I</td>
     445<td> -</td>
     446<td>-</td>
     447<td>-</td>
     448<td>-</td>
    547449</tr>
    548450<tr>   <th colspan=9> <a href="#sec:Options_for_OA_decomposition">Options for OA decomposition</a> </th>
     
    555457<td>+</td>
    556458<td>+</td>
    557 <td>+</td>
    558 <td>-</td>
    559 <td>-</td>
    560459</tr>
    561460<tr>
     
    566465<td>-</td>
    567466<td>+</td>
    568 <td>+</td>
    569 <td>-</td>
    570 <td>-</td>
    571467</tr>
    572468<tr>
     
    577473<td>-</td>
    578474<td>+</td>
    579 <td>+</td>
    580 <td>-</td>
    581 <td>-</td>
    582475</tr>
    583476<tr>   <th colspan=9> <a href="#sec:Options_for_ecp_cuts_generation">Options for ecp cuts generation</a> </th>
     
    590483<td>+</td>
    591484<td>+</td>
    592 <td>-</td>
    593 <td>-</td>
    594 <td>-</td>
    595485</tr>
    596486<tr>
     
    601491<td>+</td>
    602492<td>+</td>
    603 <td>-</td>
    604 <td>-</td>
    605 <td>-</td>
    606 </tr>
    607 <tr>
    608 <td> <a href="#sec:ecp_propability_factor">ecp_propability_factor</a> </td>
    609 <td>F</td>
    610 <td> -</td>
    611 <td>-</td>
    612 <td>+</td>
    613 <td>+</td>
    614 <td>-</td>
    615 <td>-</td>
    616 <td>-</td>
     493</tr>
     494<tr>
     495<td> <a href="#sec:ecp_probability_factor">ecp_probability_factor</a> </td>
     496<td>F</td>
     497<td> -</td>
     498<td>-</td>
     499<td>+</td>
     500<td>+</td>
    617501</tr>
    618502<tr>
     
    623507<td>+</td>
    624508<td>+</td>
    625 <td>-</td>
    626 <td>-</td>
    627 <td>-</td>
    628509</tr>
    629510<tr>
     
    634515<td>+</td>
    635516<td>+</td>
    636 <td>-</td>
    637 <td>-</td>
    638 <td>-</td>
    639517</tr>
    640518<tr>   <th colspan=9> <a href="#sec:Options_for_feasibility_checker_using_OA_cuts">Options for feasibility checker using OA cuts</a> </th>
     
    647525<td>+</td>
    648526<td>+</td>
    649 <td>+</td>
    650 <td>-</td>
    651 <td>-</td>
    652527</tr>
    653528<tr>
     
    658533<td>+</td>
    659534<td>+</td>
    660 <td>+</td>
    661 <td>-</td>
    662 <td>-</td>
    663535</tr>
    664536<tr>
     
    669541<td>+</td>
    670542<td>+</td>
    671 <td>+</td>
    672 <td>-</td>
    673 <td>-</td>
    674543</tr>
    675544<tr>   <th colspan=9> <a href="#sec:Options_for_feasibility_pump">Options for feasibility pump</a> </th>
     
    682551<td>+</td>
    683552<td>+</td>
    684 <td>-</td>
    685 <td>-</td>
    686 <td>-</td>
    687553</tr>
    688554<tr>
     
    693559<td>+</td>
    694560<td>+</td>
    695 <td>-</td>
    696 <td>-</td>
    697 <td>-</td>
     561</tr>
     562<tr>
     563<td> <a href="#sec:fp_pass_infeasible">fp_pass_infeasible</a> </td>
     564<td>S</td>
     565<td> +</td>
     566<td>+</td>
     567<td>+</td>
     568<td>+</td>
    698569</tr>
    699570<tr>   <th colspan=9> <a href="#sec:Options_for_non-convex_problems">Options for non-convex problems</a> </th>
     
    706577<td>-</td>
    707578<td>-</td>
    708 <td>-</td>
    709 <td>-</td>
    710 <td>-</td>
    711579</tr>
    712580<tr>
     
    717585<td>-</td>
    718586<td>-</td>
    719 <td>-</td>
    720 <td>-</td>
    721 <td>-</td>
    722587</tr>
    723588<tr>
     
    728593<td>-</td>
    729594<td>-</td>
    730 <td>-</td>
    731 <td>-</td>
    732 <td>-</td>
    733595</tr>
    734596<tr>
     
    739601<td>-</td>
    740602<td>-</td>
    741 <td>-</td>
    742 <td>-</td>
    743 <td>-</td>
    744603</tr>
    745604<tr>
     
    750609<td>-</td>
    751610<td>-</td>
    752 <td>-</td>
    753 <td>-</td>
    754 <td>-</td>
    755611</tr>
    756612<tr>
     
    761617<td>-</td>
    762618<td>-</td>
    763 <td>-</td>
    764 <td>-</td>
    765 <td>-</td>
    766619</tr>
    767620<tr>
     
    772625<td>-</td>
    773626<td>-</td>
    774 <td>-</td>
    775 <td>-</td>
    776 <td>-</td>
    777627</tr>
    778628<tr>
     
    783633<td>-</td>
    784634<td>-</td>
    785 <td>-</td>
    786 <td>-</td>
    787 <td>-</td>
    788635</tr>
    789636<tr>   <th colspan=9> <a href="#sec:Outer_Approximation_cuts_generation">Outer Approximation cuts generation</a> </th>
     
    796643<td>+</td>
    797644<td>+</td>
    798 <td>+</td>
    799 <td>+</td>
    800 <td>+</td>
    801645</tr>
    802646<tr>
     
    807651<td>+</td>
    808652<td>+</td>
    809 <td>+</td>
    810 <td>+</td>
    811 <td>+</td>
    812653</tr>
    813654<tr>
     
    818659<td>+</td>
    819660<td>+</td>
     661</tr>
     662<tr>
     663<td> <a href="#sec:oa_rhs_relax">oa_rhs_relax</a> </td>
     664<td>F</td>
     665<td> -</td>
    820666<td>+</td>
    821667<td>+</td>
     
    829675<td>+</td>
    830676<td>+</td>
    831 <td>+</td>
    832 <td>+</td>
    833 <td>+</td>
    834677</tr>
    835678<tr>
     
    840683<td>+</td>
    841684<td>+</td>
    842 <td>+</td>
    843 <td>+</td>
    844 <td>+</td>
    845 </tr>
    846 <tr>   <th colspan=9> <a href="#sec:Output_ond_log-levels_options">Output ond log-levels options</a> </th>
     685</tr>
     686<tr>   <th colspan=9> <a href="#sec:Output_and_log-level_options">Output and log-level options</a> </th>
    847687</tr>
    848688<tr>
     
    853693<td>+</td>
    854694<td>+</td>
    855 <td>+</td>
    856 <td>+</td>
    857 <td>+</td>
    858695</tr>
    859696<tr>
     
    864701<td>+</td>
    865702<td>+</td>
    866 <td>+</td>
    867 <td>+</td>
    868 <td>+</td>
    869703</tr>
    870704<tr>
     
    875709<td>+</td>
    876710<td>+</td>
    877 <td>+</td>
    878 <td>+</td>
    879 <td>+</td>
    880711</tr>
    881712<tr>
     
    886717<td>+</td>
    887718<td>+</td>
    888 <td>+</td>
    889 <td>+</td>
    890 <td>-</td>
    891719</tr>
    892720<tr>   <th colspan=9> <a href="#sec:Strong_branching_setup">Strong branching setup</a> </th>
     
    899727<td>+</td>
    900728<td>+</td>
    901 <td>+</td>
    902 <td>+</td>
    903 <td>-</td>
    904729</tr>
    905730<tr>
     
    910735<td>+</td>
    911736<td>+</td>
    912 <td>+</td>
    913 <td>+</td>
    914 <td>-</td>
    915737</tr>
    916738<tr>
     
    921743<td>+</td>
    922744<td>+</td>
    923 <td>+</td>
    924 <td>+</td>
    925 <td>-</td>
    926745</tr>
    927746<tr>
     
    932751<td>+</td>
    933752<td>+</td>
    934 <td>+</td>
    935 <td>+</td>
    936 <td>-</td>
    937753</tr>
    938754<tr>
     
    943759<td>+</td>
    944760<td>+</td>
    945 <td>+</td>
    946 <td>+</td>
    947 <td>-</td>
    948761</tr>
    949762<tr>
     
    954767<td>+</td>
    955768<td>+</td>
    956 <td>+</td>
    957 <td>-</td>
    958 <td>-</td>
    959769</tr>
    960770<tr>
     
    965775<td>+</td>
    966776<td>+</td>
    967 <td>+</td>
    968 <td>+</td>
    969 <td>-</td>
    970777</tr>
    971778<tr>
     
    976783<td>+</td>
    977784<td>+</td>
    978 <td>+</td>
    979 <td>+</td>
    980 <td>-</td>
    981785</tr>
    982786<tr>
     
    987791<td>+</td>
    988792<td>+</td>
    989 <td>+</td>
    990 <td>+</td>
    991 <td>-</td>
    992793</tr>
    993794<tr>   <th colspan=9> <a href="#sec:nlp_interface_option">nlp interface option</a> </th>
     
    1000801<td>+</td>
    1001802<td>+</td>
    1002 <td>+</td>
    1003 <td>+</td>
    1004 <td>+</td>
    1005803</tr>
    1006804<tr>
     
    1011809<td>+</td>
    1012810<td>+</td>
    1013 <td>+</td>
    1014 <td>+</td>
    1015 <td>+</td>
    1016811</tr>
    1017812<tr>
     
    1022817<td>+</td>
    1023818<td>+</td>
    1024 <td>+</td>
    1025 <td>+</td>
    1026 <td>+</td>
    1027819</tr>
    1028820<tr>
     
    1030822<td>S</td>
    1031823<td> +</td>
    1032 <td>-</td>
    1033 <td>-</td>
    1034 <td>-</td>
    1035824<td>-</td>
    1036825<td>-</td>
     
    1041830}
    1042831}
    1043 \subsectionH{Algorithm choice}{sec:Algorithm_choice}
    1044 \htmlanchor{sec:algorithm}
     832\subsection{Algorithm choice}
     833\label{sec:Algorithm_choice}
     834\htmlanchor{sec:Algorithm_choice}
    1045835\paragraph{algorithm:}\label{sec:algorithm} Choice of the algorithm. $\;$ \\
    1046836 This will preset some of the options of bonmin
     
    1058848\end{itemize}
    1059849
    1060 \subsectionH{Branch-and-bound options}{sec:Branch-and-bound_options}
    1061 \htmlanchor{sec:allowable\_fraction\_gap}
     850\subsection{Branch-and-bound options}
     851\label{sec:Branch-and-bound_options}
     852\htmlanchor{sec:Branch-and-bound_options}
    1062853\paragraph{allowable\_fraction\_gap:}\label{sec:allowable_fraction_gap} Specify the value of relative gap under which the algorithm stops. $\;$ \\
    1063854 Stop the tree search when the gap between the
     
    1070861
    1071862
    1072 \htmlanchor{sec:allowable\_gap}
    1073863\paragraph{allowable\_gap:}\label{sec:allowable_gap} Specify the value of absolute gap under which the algorithm stops. $\;$ \\
    1074864 Stop the tree search when the gap between the
     
    1080870
    1081871
    1082 \htmlanchor{sec:cutoff}
    1083872\paragraph{cutoff:}\label{sec:cutoff} Specify cutoff value. $\;$ \\
    1084873 cutoff should be the value of a feasible solution
    1085874known by the user (if any). The algorithm will
    1086 only look for solutions better than cutoof. The valid range for this real option is
     875only look for solutions better than cutoff. The valid range for this real option is
    1087876$-1 \cdot 10^{+100} \le {\tt cutoff } \le 1 \cdot 10^{+100}$
    1088877and its default value is $1 \cdot 10^{+100}$.
    1089878
    1090879
    1091 \htmlanchor{sec:cutoff\_decr}
    1092880\paragraph{cutoff\_decr:}\label{sec:cutoff_decr} Specify cutoff decrement. $\;$ \\
    1093881 Specify the amount by which cutoff is decremented
     
    1099887
    1100888
    1101 \htmlanchor{sec:enable\_dynamic\_nlp}
    1102889\paragraph{enable\_dynamic\_nlp:}\label{sec:enable_dynamic_nlp} Enable dynamic linear and quadratic rows addition in nlp $\;$ \\
    1103890
     
    1110897\end{itemize}
    1111898
    1112 \htmlanchor{sec:integer\_tolerance}
    1113899\paragraph{integer\_tolerance:}\label{sec:integer_tolerance} Set integer tolerance. $\;$ \\
    1114900 Any number within that value of an integer is
     
    1118904
    1119905
    1120 \htmlanchor{sec:iteration\_limit}
    1121906\paragraph{iteration\_limit:}\label{sec:iteration_limit} Set the cumulated maximum number of iteration in the algorithm used to process nodes continuous relaxations in the branch-and-bound. $\;$ \\
    1122907 value 0 deactivates option. The valid range for this integer option is
     
    1125910
    1126911
    1127 \htmlanchor{sec:nlp\_failure\_behavior}
    1128912\paragraph{nlp\_failure\_behavior:}\label{sec:nlp_failure_behavior} Set the behavior when an NLP or a series of NLP are unsolved by Ipopt (we call unsolved an NLP for which Ipopt is not able to guarantee optimality within the specified tolerances). $\;$ \\
    1129913 If set to "fathom", the algorithm will fathom the
     
    1141925\end{itemize}
    1142926
    1143 \htmlanchor{sec:node\_comparison}
    1144927\paragraph{node\_comparison:}\label{sec:node_comparison} Choose the node selection strategy. $\;$ \\
    1145928 Choose the strategy for selecting the next node
     
    1159942\end{itemize}
    1160943
    1161 \htmlanchor{sec:node\_limit}
    1162944\paragraph{node\_limit:}\label{sec:node_limit} Set the maximum number of nodes explored in the branch-and-bound search. $\;$ \\
    1163945 The valid range for this integer option is
     
    1166948
    1167949
    1168 \htmlanchor{sec:num\_cut\_passes}
    1169950\paragraph{num\_cut\_passes:}\label{sec:num_cut_passes} Set the maximum number of cut passes at regular nodes of the branch-and-cut. $\;$ \\
    1170951 The valid range for this integer option is
     
    1173954
    1174955
    1175 \htmlanchor{sec:num\_cut\_passes\_at\_root}
    1176956\paragraph{num\_cut\_passes\_at\_root:}\label{sec:num_cut_passes_at_root} Set the maximum number of cut passes at regular nodes of the branch-and-cut. $\;$ \\
    1177957 The valid range for this integer option is
     
    1180960
    1181961
    1182 \htmlanchor{sec:number\_before\_trust}
    1183962\paragraph{number\_before\_trust:}\label{sec:number_before_trust} Set the number of branches on a variable before its pseudo costs are to be believed in dynamic strong branching. $\;$ \\
    1184963 A value of 0 disables pseudo costs. The valid range for this integer option is
     
    1187966
    1188967
    1189 \htmlanchor{sec:number\_strong\_branch}
    1190968\paragraph{number\_strong\_branch:}\label{sec:number_strong_branch} Choose the maximum number of variables considered for strong branching. $\;$ \\
    1191969 Set the number of variables on which to do strong
     
    1195973
    1196974
    1197 \htmlanchor{sec:solution\_limit}
     975\paragraph{random\_generator\_seed:}\label{sec:random_generator_seed} Set seed for random number generator (a value of -1 sets seeds to time since Epoch). $\;$ \\
     976 The valid range for this integer option is
     977$-1 \le {\tt random\_generator\_seed } <  {\tt +inf}$
     978and its default value is $0$.
     979
     980
     981\paragraph{read\_solution\_file:}\label{sec:read_solution_file} Read a file with the optimal solution to test if algorithms cuts it. $\;$ \\
     982 For Debugging purposes only.
     983The default value for this string option is "no".
     984\\
     985Possible values:
     986\begin{itemize}
     987   \item no:
     988   \item yes:
     989\end{itemize}
     990
    1198991\paragraph{solution\_limit:}\label{sec:solution_limit} Abort after that much integer feasible solution have been found by algorithm $\;$ \\
    1199992 value 0 deactivates option The valid range for this integer option is
     
    1202995
    1203996
    1204 \htmlanchor{sec:sos\_constraints}
    1205997\paragraph{sos\_constraints:}\label{sec:sos_constraints} Wether or not to activate SOS constraints. $\;$ \\
    1206998 (only type 1 SOS are supported at the moment)
     
    12131005\end{itemize}
    12141006
    1215 \htmlanchor{sec:time\_limit}
    12161007\paragraph{time\_limit:}\label{sec:time_limit} Set the global maximum computation time (in secs) for the algorithm. $\;$ \\
    12171008 The valid range for this real option is
     
    12201011
    12211012
    1222 \htmlanchor{sec:tree\_search\_strategy}
    12231013\paragraph{tree\_search\_strategy:}\label{sec:tree_search_strategy} Pick a strategy for traversing the tree $\;$ \\
    12241014 All strategies can be used in conjunction with
     
    12511041\end{itemize}
    12521042
    1253 \htmlanchor{sec:variable\_selection}
    12541043\paragraph{variable\_selection:}\label{sec:variable_selection} Chooses variable selection strategy $\;$ \\
    12551044
     
    12611050   \item strong-branching: Perform strong branching
    12621051   \item reliability-branching: Use reliability branching
    1263    \item curvature-estimator: Use curvature estimation to select branching
    1264 variable
    12651052   \item qp-strong-branching: Perform strong branching with QP approximation
    12661053   \item lp-strong-branching: Perform strong branching with LP approximation
     
    12711058\end{itemize}
    12721059
    1273 \subsectionH{MILP cutting planes in hybrid}{sec:MILP_cutting_planes_in_hybrid}
    1274 \htmlanchor{sec:2mir\_cuts}
     1060\subsection{MILP cutting planes in hybrid}
     1061\label{sec:MILP_cutting_planes_in_hybrid}
     1062\htmlanchor{sec:MILP_cutting_planes_in_hybrid}
    12751063\paragraph{2mir\_cuts:}\label{sec:2mir_cuts} Frequency (in terms of nodes) for generating 2-MIR cuts in branch-and-cut $\;$ \\
    1276  If k > 0, cuts are generated every k nodes, if
    1277 -99 < k < 0 cuts are generated every -k nodes but
    1278 Cbc may decide to stop generating cuts, if not
    1279 enough are generated at the root node, if k=-99
    1280 generate cuts only at the root node, if k=0 or
    1281 100 do not generate cuts. The valid range for this integer option is
     1064 If $k > 0$, cuts are generated every $k$ nodes,
     1065if $-99 < k < 0$ cuts are generated every $-k$
     1066nodes but Cbc may decide to stop generating cuts,
     1067if not enough are generated at the root node, if
     1068$k=-99$ generate cuts only at the root node, if
     1069$k=0$ or $100$ do not generate cuts. The valid range for this integer option is
    12821070$-100 \le {\tt 2mir\_cuts } <  {\tt +inf}$
    12831071and its default value is $0$.
    12841072
    12851073
    1286 \htmlanchor{sec:Gomory\_cuts}
    12871074\paragraph{Gomory\_cuts:}\label{sec:Gomory_cuts} Frequency k (in terms of nodes) for generating Gomory cuts in branch-and-cut. $\;$ \\
    1288  If k > 0, cuts are generated every k nodes, if
    1289 -99 < k < 0 cuts are generated every -k nodes but
    1290 Cbc may decide to stop generating cuts, if not
    1291 enough are generated at the root node, if k=-99
    1292 generate cuts only at the root node, if k=0 or
    1293 100 do not generate cuts. The valid range for this integer option is
     1075 If $k > 0$, cuts are generated every $k$ nodes,
     1076if $-99 < k < 0$ cuts are generated every $-k$
     1077nodes but Cbc may decide to stop generating cuts,
     1078if not enough are generated at the root node, if
     1079$k=-99$ generate cuts only at the root node, if
     1080$k=0$ or $100$ do not generate cuts. The valid range for this integer option is
    12941081$-100 \le {\tt Gomory\_cuts } <  {\tt +inf}$
    12951082and its default value is $-5$.
    12961083
    12971084
    1298 \htmlanchor{sec:clique\_cuts}
    12991085\paragraph{clique\_cuts:}\label{sec:clique_cuts} Frequency (in terms of nodes) for generating clique cuts in branch-and-cut $\;$ \\
    1300  If k > 0, cuts are generated every k nodes, if
    1301 -99 < k < 0 cuts are generated every -k nodes but
    1302 Cbc may decide to stop generating cuts, if not
    1303 enough are generated at the root node, if k=-99
    1304 generate cuts only at the root node, if k=0 or
    1305 100 do not generate cuts. The valid range for this integer option is
     1086 If $k > 0$, cuts are generated every $k$ nodes,
     1087if $-99 < k < 0$ cuts are generated every $-k$
     1088nodes but Cbc may decide to stop generating cuts,
     1089if not enough are generated at the root node, if
     1090$k=-99$ generate cuts only at the root node, if
     1091$k=0$ or $100$ do not generate cuts. The valid range for this integer option is
    13061092$-100 \le {\tt clique\_cuts } <  {\tt +inf}$
    13071093and its default value is $-5$.
    13081094
    13091095
    1310 \htmlanchor{sec:cover\_cuts}
    13111096\paragraph{cover\_cuts:}\label{sec:cover_cuts} Frequency (in terms of nodes) for generating cover cuts in branch-and-cut $\;$ \\
    1312  If k > 0, cuts are generated every k nodes, if
    1313 -99 < k < 0 cuts are generated every -k nodes but
    1314 Cbc may decide to stop generating cuts, if not
    1315 enough are generated at the root node, if k=-99
    1316 generate cuts only at the root node, if k=0 or
    1317 100 do not generate cuts. The valid range for this integer option is
     1097 If $k > 0$, cuts are generated every $k$ nodes,
     1098if $-99 < k < 0$ cuts are generated every $-k$
     1099nodes but Cbc may decide to stop generating cuts,
     1100if not enough are generated at the root node, if
     1101$k=-99$ generate cuts only at the root node, if
     1102$k=0$ or $100$ do not generate cuts. The valid range for this integer option is
    13181103$-100 \le {\tt cover\_cuts } <  {\tt +inf}$
    1319 and its default value is $-5$.
    1320 
    1321 
    1322 \htmlanchor{sec:flow\_cover\_cuts}
     1104and its default value is $0$.
     1105
     1106
    13231107\paragraph{flow\_cover\_cuts:}\label{sec:flow_cover_cuts} Frequency (in terms of nodes) for generating flow cover cuts in branch-and-cut $\;$ \\
    1324  If k > 0, cuts are generated every k nodes, if
    1325 -99 < k < 0 cuts are generated every -k nodes but
    1326 Cbc may decide to stop generating cuts, if not
    1327 enough are generated at the root node, if k=-99
    1328 generate cuts only at the root node, if k=0 or
    1329 100 do not generate cuts. The valid range for this integer option is
     1108 If $k > 0$, cuts are generated every $k$ nodes,
     1109if $-99 < k < 0$ cuts are generated every $-k$
     1110nodes but Cbc may decide to stop generating cuts,
     1111if not enough are generated at the root node, if
     1112$k=-99$ generate cuts only at the root node, if
     1113$k=0$ or $100$ do not generate cuts. The valid range for this integer option is
    13301114$-100 \le {\tt flow\_cover\_cuts } <  {\tt +inf}$
    13311115and its default value is $-5$.
    13321116
    13331117
    1334 \htmlanchor{sec:lift\_and\_project\_cuts}
    13351118\paragraph{lift\_and\_project\_cuts:}\label{sec:lift_and_project_cuts} Frequency (in terms of nodes) for generating lift-and-project cuts in branch-and-cut $\;$ \\
    1336  If k > 0, cuts are generated every k nodes, if
    1337 -99 < k < 0 cuts are generated every -k nodes but
    1338 Cbc may decide to stop generating cuts, if not
    1339 enough are generated at the root node, if k=-99
    1340 generate cuts only at the root node, if k=0 or
    1341 100 do not generate cuts. The valid range for this integer option is
     1119 If $k > 0$, cuts are generated every $k$ nodes,
     1120if $-99 < k < 0$ cuts are generated every $-k$
     1121nodes but Cbc may decide to stop generating cuts,
     1122if not enough are generated at the root node, if
     1123$k=-99$ generate cuts only at the root node, if
     1124$k=0$ or $100$ do not generate cuts. The valid range for this integer option is
    13421125$-100 \le {\tt lift\_and\_project\_cuts } <  {\tt +inf}$
    13431126and its default value is $0$.
    13441127
    13451128
    1346 \htmlanchor{sec:mir\_cuts}
    13471129\paragraph{mir\_cuts:}\label{sec:mir_cuts} Frequency (in terms of nodes) for generating MIR cuts in branch-and-cut $\;$ \\
    1348  If k > 0, cuts are generated every k nodes, if
    1349 -99 < k < 0 cuts are generated every -k nodes but
    1350 Cbc may decide to stop generating cuts, if not
    1351 enough are generated at the root node, if k=-99
    1352 generate cuts only at the root node, if k=0 or
    1353 100 do not generate cuts. The valid range for this integer option is
     1130 If $k > 0$, cuts are generated every $k$ nodes,
     1131if $-99 < k < 0$ cuts are generated every $-k$
     1132nodes but Cbc may decide to stop generating cuts,
     1133if not enough are generated at the root node, if
     1134$k=-99$ generate cuts only at the root node, if
     1135$k=0$ or $100$ do not generate cuts. The valid range for this integer option is
    13541136$-100 \le {\tt mir\_cuts } <  {\tt +inf}$
    13551137and its default value is $-5$.
    13561138
    13571139
    1358 \htmlanchor{sec:reduce\_and\_split\_cuts}
    13591140\paragraph{reduce\_and\_split\_cuts:}\label{sec:reduce_and_split_cuts} Frequency (in terms of nodes) for generating reduce-and-split cuts in branch-and-cut $\;$ \\
    1360  If k > 0, cuts are generated every k nodes, if
    1361 -99 < k < 0 cuts are generated every -k nodes but
    1362 Cbc may decide to stop generating cuts, if not
    1363 enough are generated at the root node, if k=-99
    1364 generate cuts only at the root node, if k=0 or
    1365 100 do not generate cuts. The valid range for this integer option is
     1141 If $k > 0$, cuts are generated every $k$ nodes,
     1142if $-99 < k < 0$ cuts are generated every $-k$
     1143nodes but Cbc may decide to stop generating cuts,
     1144if not enough are generated at the root node, if
     1145$k=-99$ generate cuts only at the root node, if
     1146$k=0$ or $100$ do not generate cuts. The valid range for this integer option is
    13661147$-100 \le {\tt reduce\_and\_split\_cuts } <  {\tt +inf}$
    13671148and its default value is $0$.
    13681149
    13691150
    1370 \subsectionH{MINLP Heuristics}{sec:MINLP_Heuristics}
    1371 \htmlanchor{sec:feasibility\_pump\_objective\_norm}
     1151\subsection{MINLP Heuristics}
     1152\label{sec:MINLP_Heuristics}
     1153\htmlanchor{sec:MINLP_Heuristics}
    13721154\paragraph{feasibility\_pump\_objective\_norm:}\label{sec:feasibility_pump_objective_norm} Norm of feasibility pump objective function $\;$ \\
    13731155 The valid range for this integer option is
     
    13761158
    13771159
    1378 \htmlanchor{sec:heuristic\_RINS}
    13791160\paragraph{heuristic\_RINS:}\label{sec:heuristic_RINS} if yes runs the RINS heuristic $\;$ \\
    13801161
     
    13871168\end{itemize}
    13881169
    1389 \htmlanchor{sec:heuristic\_dive\_MIP\_vectorLength}
    1390 \paragraph{heuristic\_dive\_MIP\_vectorLength:}\label{sec:heuristic_dive_MIP_vectorLength} if yes runs the Dive MIP VectorLength heuristic $\;$ \\
     1170\paragraph{heuristic\_dive\_MIP\_fractional:}\label{sec:heuristic_dive_MIP_fractional} if yes runs the Dive MIP Fractional heuristic $\;$ \\
    13911171
    13921172The default value for this string option is "no".
     
    13981178\end{itemize}
    13991179
    1400 \htmlanchor{sec:heuristic\_dive\_fractional}
    1401 \paragraph{heuristic\_dive\_fractional:}\label{sec:heuristic_dive_fractional} if yes runs the Dive Fractional heuristic $\;$ \\
     1180\paragraph{heuristic\_dive\_MIP\_vectorLength:}\label{sec:heuristic_dive_MIP_vectorLength} if yes runs the Dive MIP VectorLength heuristic $\;$ \\
    14021181
    14031182The default value for this string option is "no".
     
    14091188\end{itemize}
    14101189
    1411 \htmlanchor{sec:heuristic\_dive\_vectorLength}
    1412 \paragraph{heuristic\_dive\_vectorLength:}\label{sec:heuristic_dive_vectorLength} if yes runs the Dive VectorLength heuristic $\;$ \\
     1190\paragraph{heuristic\_dive\_fractional:}\label{sec:heuristic_dive_fractional} if yes runs the Dive Fractional heuristic $\;$ \\
    14131191
    14141192The default value for this string option is "no".
     
    14201198\end{itemize}
    14211199
    1422 \htmlanchor{sec:heuristic\_feasibility\_pump}
     1200\paragraph{heuristic\_dive\_vectorLength:}\label{sec:heuristic_dive_vectorLength} if yes runs the Dive VectorLength heuristic $\;$ \\
     1201
     1202The default value for this string option is "no".
     1203\\
     1204Possible values:
     1205\begin{itemize}
     1206   \item no: don't run it
     1207   \item yes: runs the heuristic
     1208\end{itemize}
     1209
    14231210\paragraph{heuristic\_feasibility\_pump:}\label{sec:heuristic_feasibility_pump} whether the heuristic feasibility pump should be used $\;$ \\
    14241211
     
    14311218\end{itemize}
    14321219
    1433 \htmlanchor{sec:pump\_for\_minlp}
    14341220\paragraph{pump\_for\_minlp:}\label{sec:pump_for_minlp} if yes runs FP for MINLP $\;$ \\
    14351221
     
    14421228\end{itemize}
    14431229
    1444 \subsectionH{MINLP heuristics}{sec:MINLP_heuristics}
    1445 \htmlanchor{sec:heuristic\_dive\_MIP\_fractional}
    1446 \paragraph{heuristic\_dive\_MIP\_fractional:}\label{sec:heuristic_dive_MIP_fractional} if yes runs the Dive MIP Fractional heuristic $\;$ \\
    1447 
    1448 The default value for this string option is "no".
    1449 \\
    1450 Possible values:
    1451 \begin{itemize}
    1452    \item no: don't run it
    1453    \item yes: runs the heuristic
    1454 \end{itemize}
    1455 
    1456 \subsectionH{Nlp solution robustness}{sec:Nlp_solution_robustness}
    1457 \htmlanchor{sec:max\_consecutive\_failures}
     1230\subsection{Nlp solution robustness}
     1231\label{sec:Nlp_solution_robustness}
     1232\htmlanchor{sec:Nlp_solution_robustness}
    14581233\paragraph{max\_consecutive\_failures:}\label{sec:max_consecutive_failures} (temporarily removed) Number $n$ of consecutive unsolved problems before aborting a branch of the tree. $\;$ \\
    14591234 When $n > 0$, continue exploring a branch of the
     
    14661241
    14671242
    1468 \htmlanchor{sec:max\_random\_point\_radius}
    14691243\paragraph{max\_random\_point\_radius:}\label{sec:max_random_point_radius} Set max value r for coordinate of a random point. $\;$ \\
    1470  When picking a random point coordinate i will be
     1244 When picking a random point, coordinate i will be
    14711245in the interval [min(max(l,-r),u-r),
    14721246max(min(u,r),l+r)] (where l is the lower bound
     
    14761250
    14771251
    1478 \htmlanchor{sec:num\_iterations\_suspect}
    14791252\paragraph{num\_iterations\_suspect:}\label{sec:num_iterations_suspect} Number of iterations over which a node is considered "suspect" (for debugging purposes only, see detailed documentation). $\;$ \\
    14801253 When the number of iterations to solve a node is
     
    14861259
    14871260
    1488 \htmlanchor{sec:num\_retry\_unsolved\_random\_point}
    14891261\paragraph{num\_retry\_unsolved\_random\_point:}\label{sec:num_retry_unsolved_random_point} Number $k$ of times that the algorithm will try to resolve an unsolved NLP with a random starting point (we call unsolved an NLP for which Ipopt is not able to guarantee optimality within the specified tolerances). $\;$ \\
    14901262 When Ipopt fails to solve a continuous NLP
     
    14971269
    14981270
    1499 \htmlanchor{sec:random\_point\_perturbation\_interval}
    15001271\paragraph{random\_point\_perturbation\_interval:}\label{sec:random_point_perturbation_interval} Amount by which starting point is perturbed when choosing to pick random point by perturbating starting point $\;$ \\
    15011272 The valid range for this real option is
     
    15041275
    15051276
    1506 \htmlanchor{sec:random\_point\_type}
    15071277\paragraph{random\_point\_type:}\label{sec:random_point_type} method to choose a random starting point $\;$ \\
    15081278
     
    15181288\end{itemize}
    15191289
    1520 \subsectionH{Nlp solve options in B-Hyb}{sec:Nlp_solve_options_in_B-Hyb}
    1521 \htmlanchor{sec:nlp\_solve\_frequency}
     1290\paragraph{resolve\_on\_small\_infeasibility:}\label{sec:resolve_on_small_infeasibility} If a locally infeasible problem is infeasible by less than this, resolve it with initial starting point. $\;$ \\
     1291 It is set to 0 by default with Ipopt. For filter
     1292Bonmin sets it to a small value. The valid range for this real option is
     1293$0 \le {\tt resolve\_on\_small\_infeasibility } <  {\tt +inf}$
     1294and its default value is $0$.
     1295
     1296
     1297\subsection{Nlp solve options in B-Hyb}
     1298\label{sec:Nlp_solve_options_in_B-Hyb}
     1299\htmlanchor{sec:Nlp_solve_options_in_B-Hyb}
    15221300\paragraph{nlp\_solve\_frequency:}\label{sec:nlp_solve_frequency} Specify the frequency (in terms of nodes) at which NLP relaxations are solved in B-Hyb. $\;$ \\
    15231301 A frequency of 0 amounts to to never solve the
     
    15271305
    15281306
    1529 \htmlanchor{sec:nlp\_solve\_max\_depth}
    15301307\paragraph{nlp\_solve\_max\_depth:}\label{sec:nlp_solve_max_depth} Set maximum depth in the tree at which NLP relaxations are solved in B-Hyb. $\;$ \\
    15311308 A depth of 0 amounts to to never solve the NLP
     
    15351312
    15361313
    1537 \htmlanchor{sec:nlp\_solves\_per\_depth}
    15381314\paragraph{nlp\_solves\_per\_depth:}\label{sec:nlp_solves_per_depth} Set average number of nodes in the tree at which NLP relaxations are solved in B-Hyb for each depth. $\;$ \\
    15391315 The valid range for this real option is
     
    15421318
    15431319
    1544 \subsectionH{Options for MILP solver}{sec:Options_for_MILP_solver}
    1545 \htmlanchor{sec:milp\_log\_level}
     1320\subsection{Options for MILP solver}
     1321\label{sec:Options_for_MILP_solver}
     1322\htmlanchor{sec:Options_for_MILP_solver}
     1323\paragraph{cpx\_parallel\_strategy:}\label{sec:cpx_parallel_strategy} Strategy of parallel search mode in CPLEX. $\;$ \\
     1324 -1 = opportunistic, 0 = automatic, 1 =
     1325deterministic (refer to CPLEX documentation) The valid range for this integer option is
     1326$-1 \le {\tt cpx\_parallel\_strategy } \le 1$
     1327and its default value is $0$.
     1328
     1329
    15461330\paragraph{milp\_log\_level:}\label{sec:milp_log_level} specify MILP solver log level. $\;$ \\
    15471331 Set the level of output of the MILP subsolver in
    15481332OA : 0 - none, 1 - minimal, 2 - normal low, 3 -
    15491333normal high The valid range for this integer option is
    1550 $0 \le {\tt milp\_log\_level } \le 3$
    1551 and its default value is $0$.
    1552 
    1553 
    1554 \htmlanchor{sec:milp\_solver}
     1334$0 \le {\tt milp\_log\_level } \le 4$
     1335and its default value is $0$.
     1336
     1337
    15551338\paragraph{milp\_solver:}\label{sec:milp_solver} Choose the subsolver to solve MILP sub-problems in OA decompositions. $\;$ \\
    15561339  To use Cplex, a valid license is required and
     
    15661349\end{itemize}
    15671350
    1568 \subsectionH{Options for OA decomposition}{sec:Options_for_OA_decomposition}
    1569 \htmlanchor{sec:oa\_decomposition}
     1351\paragraph{milp\_strategy:}\label{sec:milp_strategy} Choose a strategy for MILPs. $\;$ \\
     1352
     1353The default value for this string option is "find\_good\_sol".
     1354\\
     1355Possible values:
     1356\begin{itemize}
     1357   \item find\_good\_sol: Stop sub milps when a solution improving the
     1358incumbent is found
     1359   \item solve\_to\_optimality: Solve MILPs to optimality
     1360\end{itemize}
     1361
     1362\paragraph{number\_cpx\_threads:}\label{sec:number_cpx_threads} Set number of threads to use with cplex. $\;$ \\
     1363 (refer to CPLEX documentation) The valid range for this integer option is
     1364$0 \le {\tt number\_cpx\_threads } <  {\tt +inf}$
     1365and its default value is $0$.
     1366
     1367
     1368\subsection{Options for OA decomposition}
     1369\label{sec:Options_for_OA_decomposition}
     1370\htmlanchor{sec:Options_for_OA_decomposition}
    15701371\paragraph{oa\_decomposition:}\label{sec:oa_decomposition} If yes do initial OA decomposition $\;$ \\
    15711372
     
    15781379\end{itemize}
    15791380
    1580 \htmlanchor{sec:oa\_log\_frequency}
    15811381\paragraph{oa\_log\_frequency:}\label{sec:oa_log_frequency} display an update on lower and upper bounds in OA every n seconds $\;$ \\
    15821382 The valid range for this real option is
     
    15851385
    15861386
    1587 \htmlanchor{sec:oa\_log\_level}
    15881387\paragraph{oa\_log\_level:}\label{sec:oa_log_level} specify OA iterations log level. $\;$ \\
    15891388 Set the level of output of OA decomposition
     
    15931392
    15941393
    1595 \subsectionH{Options for ecp cuts generation}{sec:Options_for_ecp_cuts_generation}
    1596 \htmlanchor{sec:ecp\_abs\_tol}
     1394\subsection{Options for ecp cuts generation}
     1395\label{sec:Options_for_ecp_cuts_generation}
     1396\htmlanchor{sec:Options_for_ecp_cuts_generation}
    15971397\paragraph{ecp\_abs\_tol:}\label{sec:ecp_abs_tol} Set the absolute termination tolerance for ECP rounds. $\;$ \\
    15981398 The valid range for this real option is
     
    16011401
    16021402
    1603 \htmlanchor{sec:ecp\_max\_rounds}
    16041403\paragraph{ecp\_max\_rounds:}\label{sec:ecp_max_rounds} Set the maximal number of rounds of ECP cuts. $\;$ \\
    16051404 The valid range for this integer option is
     
    16081407
    16091408
    1610 \htmlanchor{sec:ecp\_propability\_factor}
    1611 \paragraph{ecp\_propability\_factor:}\label{sec:ecp_propability_factor} Factor appearing in formula for skipping ECP cuts. $\;$ \\
     1409\paragraph{ecp\_probability\_factor:}\label{sec:ecp_probability_factor} Factor appearing in formula for skipping ECP cuts. $\;$ \\
    16121410 Choosing -1 disables the skipping. The valid range for this real option is
    1613 ${\tt -inf} <  {\tt ecp\_propability\_factor } <  {\tt +inf}$
     1411${\tt -inf} <  {\tt ecp\_probability\_factor } <  {\tt +inf}$
    16141412and its default value is $10$.
    16151413
    16161414
    1617 \htmlanchor{sec:ecp\_rel\_tol}
    16181415\paragraph{ecp\_rel\_tol:}\label{sec:ecp_rel_tol} Set the relative termination tolerance for ECP rounds. $\;$ \\
    16191416 The valid range for this real option is
     
    16221419
    16231420
    1624 \htmlanchor{sec:filmint\_ecp\_cuts}
    16251421\paragraph{filmint\_ecp\_cuts:}\label{sec:filmint_ecp_cuts} Specify the frequency (in terms of nodes) at which some a la filmint ecp cuts are generated. $\;$ \\
    16261422 A frequency of 0 amounts to to never solve the
     
    16301426
    16311427
    1632 \subsectionH{Options for feasibility checker using OA cuts}{sec:Options_for_feasibility_checker_using_OA_cuts}
    1633 \htmlanchor{sec:feas\_check\_cut\_types}
     1428\subsection{Options for feasibility checker using OA cuts}
     1429\label{sec:Options_for_feasibility_checker_using_OA_cuts}
     1430\htmlanchor{sec:Options_for_feasibility_checker_using_OA_cuts}
    16341431\paragraph{feas\_check\_cut\_types:}\label{sec:feas_check_cut_types} Choose the type of cuts generated when an integer feasible solution is found $\;$ \\
    16351432 If it seems too much memory is used should try
    16361433Benders to use less
    1637 The default value for this string option is "outer-approximations".
    1638 \\
    1639 Possible values:
    1640 \begin{itemize}
    1641    \item outer-approximations: Generate a set of Outer Approximations cuts.
     1434The default value for this string option is "outer-approx".
     1435\\
     1436Possible values:
     1437\begin{itemize}
     1438   \item outer-approx: Generate a set of Outer Approximations cuts.
    16421439   \item Benders: Generate a single Benders cut.
    16431440\end{itemize}
    16441441
    1645 \htmlanchor{sec:feas\_check\_discard\_policy}
    16461442\paragraph{feas\_check\_discard\_policy:}\label{sec:feas_check_discard_policy} How cuts from feasibility checker are discarded $\;$ \\
    16471443 Normally to avoid cycle cuts from feasibility
     
    16691465\end{itemize}
    16701466
    1671 \htmlanchor{sec:generate\_benders\_after\_so\_many\_oa}
    16721467\paragraph{generate\_benders\_after\_so\_many\_oa:}\label{sec:generate_benders_after_so_many_oa} Specify that after so many oa cuts have been generated Benders cuts should be generated instead. $\;$ \\
    16731468 It seems that sometimes generating too many oa
     
    16801475
    16811476
    1682 \subsectionH{Options for feasibility pump}{sec:Options_for_feasibility_pump}
    1683 \htmlanchor{sec:fp\_log\_frequency}
     1477\subsection{Options for feasibility pump}
     1478\label{sec:Options_for_feasibility_pump}
     1479\htmlanchor{sec:Options_for_feasibility_pump}
    16841480\paragraph{fp\_log\_frequency:}\label{sec:fp_log_frequency} display an update on lower and upper bounds in FP every n seconds $\;$ \\
    16851481 The valid range for this real option is
     
    16881484
    16891485
    1690 \htmlanchor{sec:fp\_log\_level}
    16911486\paragraph{fp\_log\_level:}\label{sec:fp_log_level} specify FP iterations log level. $\;$ \\
    16921487 Set the level of output of OA decomposition
     
    16961491
    16971492
    1698 \subsectionH{Options for non-convex problems}{sec:Options_for_non-convex_problems}
    1699 \htmlanchor{sec:coeff\_var\_threshold}
     1493\paragraph{fp\_pass\_infeasible:}\label{sec:fp_pass_infeasible} Say whether feasibility pump should claim to converge or not $\;$ \\
     1494
     1495The default value for this string option is "no".
     1496\\
     1497Possible values:
     1498\begin{itemize}
     1499   \item no: When master MILP is infeasible just bail out
     1500(don't stop all algorithm). This is the option
     1501for using in B-Hyb.
     1502   \item yes: Claim convergence, numerically dangerous.
     1503\end{itemize}
     1504
     1505\subsection{Options for non-convex problems}
     1506\label{sec:Options_for_non-convex_problems}
     1507\htmlanchor{sec:Options_for_non-convex_problems}
    17001508\paragraph{coeff\_var\_threshold:}\label{sec:coeff_var_threshold} Coefficient of variation threshold (for dynamic definition of cutoff\_decr). $\;$ \\
    1701  Coefficient of variation threshold (for dynamic
    1702 definition of cutoff\_decr). The valid range for this real option is
     1509 The valid range for this real option is
    17031510$0 \le {\tt coeff\_var\_threshold } <  {\tt +inf}$
    17041511and its default value is $0.1$.
    17051512
    17061513
    1707 \htmlanchor{sec:dynamic\_def\_cutoff\_decr}
    17081514\paragraph{dynamic\_def\_cutoff\_decr:}\label{sec:dynamic_def_cutoff_decr} Do you want to define the parameter cutoff\_decr dynamically? $\;$ \\
    17091515
     
    17161522\end{itemize}
    17171523
    1718 \htmlanchor{sec:first\_perc\_for\_cutoff\_decr}
    17191524\paragraph{first\_perc\_for\_cutoff\_decr:}\label{sec:first_perc_for_cutoff_decr} The percentage used when, the coeff of variance is smaller than the threshold, to compute the cutoff\_decr dynamically. $\;$ \\
    1720  The percentage used when, the coeff of variance
    1721 is smaller than the threshold, to compute the
    1722 cutoff\_decr dynamically. The valid range for this real option is
     1525 The valid range for this real option is
    17231526${\tt -inf} <  {\tt first\_perc\_for\_cutoff\_decr } <  {\tt +inf}$
    17241527and its default value is $-0.02$.
    17251528
    17261529
    1727 \htmlanchor{sec:max\_consecutive\_infeasible}
    17281530\paragraph{max\_consecutive\_infeasible:}\label{sec:max_consecutive_infeasible} Number of consecutive infeasible subproblems before aborting a branch. $\;$ \\
    17291531 Will continue exploring a branch of the tree
     
    17341536
    17351537
    1736 \htmlanchor{sec:num\_resolve\_at\_infeasibles}
    17371538\paragraph{num\_resolve\_at\_infeasibles:}\label{sec:num_resolve_at_infeasibles} Number $k$ of tries to resolve an infeasible node (other than the root) of the tree with different starting point. $\;$ \\
    17381539 The algorithm will solve all the infeasible nodes
     
    17431544
    17441545
    1745 \htmlanchor{sec:num\_resolve\_at\_node}
    17461546\paragraph{num\_resolve\_at\_node:}\label{sec:num_resolve_at_node} Number $k$ of tries to resolve a node (other than the root) of the tree with different starting point. $\;$ \\
    17471547 The algorithm will solve all the nodes with $k$
     
    17521552
    17531553
    1754 \htmlanchor{sec:num\_resolve\_at\_root}
    17551554\paragraph{num\_resolve\_at\_root:}\label{sec:num_resolve_at_root} Number $k$ of tries to resolve the root node with different starting points. $\;$ \\
    17561555 The algorithm will solve the root node with $k$
     
    17611560
    17621561
    1763 \htmlanchor{sec:second\_perc\_for\_cutoff\_decr}
    17641562\paragraph{second\_perc\_for\_cutoff\_decr:}\label{sec:second_perc_for_cutoff_decr} The percentage used when, the coeff of variance is greater than the threshold, to compute the cutoff\_decr dynamically. $\;$ \\
    1765  The percentage used when, the coeff of variance
    1766 is greater than the threshold, to compute the
    1767 cutoff\_decr dynamically. The valid range for this real option is
     1563 The valid range for this real option is
    17681564${\tt -inf} <  {\tt second\_perc\_for\_cutoff\_decr } <  {\tt +inf}$
    17691565and its default value is $-0.05$.
    17701566
    17711567
    1772 \subsectionH{Outer Approximation cuts generation}{sec:Outer_Approximation_cuts_generation}
    1773 \htmlanchor{sec:add\_only\_violated\_oa}
     1568\subsection{Outer Approximation cuts generation}
     1569\label{sec:Outer_Approximation_cuts_generation}
     1570\htmlanchor{sec:Outer_Approximation_cuts_generation}
    17741571\paragraph{add\_only\_violated\_oa:}\label{sec:add_only_violated_oa} Do we add all OA cuts or only the ones violated by current point? $\;$ \\
    17751572
     
    17821579\end{itemize}
    17831580
    1784 \htmlanchor{sec:oa\_cuts\_log\_level}
    17851581\paragraph{oa\_cuts\_log\_level:}\label{sec:oa_cuts_log_level} level of log when generating OA cuts. $\;$ \\
    17861582 0: outputs nothing,
     
    17951591
    17961592
    1797 \htmlanchor{sec:oa\_cuts\_scope}
    17981593\paragraph{oa\_cuts\_scope:}\label{sec:oa_cuts_scope} Specify if OA cuts added are to be set globally or locally valid $\;$ \\
    17991594
     
    18021597Possible values:
    18031598\begin{itemize}
    1804    \item local: Cuts are treated as globally valid
    1805    \item global: Cuts are treated as locally valid
    1806 \end{itemize}
    1807 
    1808 \htmlanchor{sec:tiny\_element}
     1599   \item local: Cuts are treated as locally valid
     1600   \item global: Cuts are treated as globally valid
     1601\end{itemize}
     1602
     1603\paragraph{oa\_rhs\_relax:}\label{sec:oa_rhs_relax} Value by which to relax OA cut $\;$ \\
     1604 RHS of OA constraints will be relaxed by this
     1605amount times the absolute value of the initial
     1606rhs if it is >= 1 (otherwise by this amount). The valid range for this real option is
     1607$-0 \le {\tt oa\_rhs\_relax } <  {\tt +inf}$
     1608and its default value is $1 \cdot 10^{-08}$.
     1609
     1610
    18091611\paragraph{tiny\_element:}\label{sec:tiny_element} Value for tiny element in OA cut $\;$ \\
    18101612 We will remove "cleanly" (by relaxing cut) an
     
    18141616
    18151617
    1816 \htmlanchor{sec:very\_tiny\_element}
    18171618\paragraph{very\_tiny\_element:}\label{sec:very_tiny_element} Value for very tiny element in OA cut $\;$ \\
    18181619 Algorithm will take the risk of neglecting an
     
    18221623
    18231624
    1824 \subsectionH{Output ond log-levels options}{sec:Output_ond_log-levels_options}
    1825 \htmlanchor{sec:bb\_log\_interval}
     1625\subsection{Output and log-level options}
     1626\label{sec:Output_and_log-level_options}
     1627\htmlanchor{sec:Output_and_log-level_options}
    18261628\paragraph{bb\_log\_interval:}\label{sec:bb_log_interval} Interval at which node level output is printed. $\;$ \\
    18271629 Set the interval (in terms of number of nodes) at
     
    18321634
    18331635
    1834 \htmlanchor{sec:bb\_log\_level}
    18351636\paragraph{bb\_log\_level:}\label{sec:bb_log_level} specify main branch-and-bound log level. $\;$ \\
    18361637 Set the level of output of the branch-and-bound :
     
    18411642
    18421643
    1843 \htmlanchor{sec:lp\_log\_level}
    18441644\paragraph{lp\_log\_level:}\label{sec:lp_log_level} specify LP log level. $\;$ \\
    18451645 Set the level of output of the linear programming
     
    18511651
    18521652
    1853 \htmlanchor{sec:nlp\_log\_at\_root}
    18541653\paragraph{nlp\_log\_at\_root:}\label{sec:nlp_log_at_root}  Specify a different log level for root relaxtion. $\;$ \\
    18551654 The valid range for this integer option is
     
    18581657
    18591658
    1860 \subsectionH{Strong branching setup}{sec:Strong_branching_setup}
    1861 \htmlanchor{sec:candidate\_sort\_criterion}
     1659\subsection{Strong branching setup}
     1660\label{sec:Strong_branching_setup}
     1661\htmlanchor{sec:Strong_branching_setup}
    18621662\paragraph{candidate\_sort\_criterion:}\label{sec:candidate_sort_criterion} Choice of the criterion to choose candidates in strong-branching $\;$ \\
    18631663
     
    18721672\end{itemize}
    18731673
    1874 \htmlanchor{sec:maxmin\_crit\_have\_sol}
    18751674\paragraph{maxmin\_crit\_have\_sol:}\label{sec:maxmin_crit_have_sol} Weight towards minimum in of lower and upper branching estimates when a solution has been found. $\;$ \\
    18761675 The valid range for this real option is
     
    18791678
    18801679
    1881 \htmlanchor{sec:maxmin\_crit\_no\_sol}
    18821680\paragraph{maxmin\_crit\_no\_sol:}\label{sec:maxmin_crit_no_sol} Weight towards minimum in of lower and upper branching estimates when no solution has been found yet. $\;$ \\
    18831681 The valid range for this real option is
     
    18861684
    18871685
    1888 \htmlanchor{sec:min\_number\_strong\_branch}
    18891686\paragraph{min\_number\_strong\_branch:}\label{sec:min_number_strong_branch} Sets minimum number of variables for strong branching (overriding trust) $\;$ \\
    18901687 The valid range for this integer option is
     
    18931690
    18941691
    1895 \htmlanchor{sec:number\_before\_trust\_list}
    18961692\paragraph{number\_before\_trust\_list:}\label{sec:number_before_trust_list} Set the number of branches on a variable before its pseudo costs are to be believed during setup of strong branching candidate list. $\;$ \\
    18971693 The default value is that of
     
    19011697
    19021698
    1903 \htmlanchor{sec:number\_look\_ahead}
    19041699\paragraph{number\_look\_ahead:}\label{sec:number_look_ahead} Sets limit of look-ahead strong-branching trials $\;$ \\
    19051700 The valid range for this integer option is
     
    19081703
    19091704
    1910 \htmlanchor{sec:number\_strong\_branch\_root}
    19111705\paragraph{number\_strong\_branch\_root:}\label{sec:number_strong_branch_root} Maximum number of variables considered for strong branching in root node. $\;$ \\
    19121706 The valid range for this integer option is
     
    19151709
    19161710
    1917 \htmlanchor{sec:setup\_pseudo\_frac}
    19181711\paragraph{setup\_pseudo\_frac:}\label{sec:setup_pseudo_frac} Proportion of strong branching list that has to be taken from most-integer-infeasible list. $\;$ \\
    19191712 The valid range for this real option is
     
    19221715
    19231716
    1924 \htmlanchor{sec:trust\_strong\_branching\_for\_pseudo\_cost}
    19251717\paragraph{trust\_strong\_branching\_for\_pseudo\_cost:}\label{sec:trust_strong_branching_for_pseudo_cost} Whether or not to trust strong branching results for updating pseudo costs. $\;$ \\
    19261718
     
    19331725\end{itemize}
    19341726
    1935 \subsectionH{nlp interface option}{sec:nlp_interface_option}
    1936 \htmlanchor{sec:file\_solution}
     1727\subsection{nlp interface option}
     1728\label{sec:nlp_interface_option}
     1729\htmlanchor{sec:nlp_interface_option}
    19371730\paragraph{file\_solution:}\label{sec:file_solution} Write a file bonmin.sol with the solution $\;$ \\
    19381731
     
    19451738\end{itemize}
    19461739
    1947 \htmlanchor{sec:nlp\_log\_level}
    19481740\paragraph{nlp\_log\_level:}\label{sec:nlp_log_level} specify NLP solver interface log level (independent from ipopt print\_level). $\;$ \\
    19491741 Set the level of output of the OsiTMINLPInterface
     
    19531745
    19541746
    1955 \htmlanchor{sec:nlp\_solver}
    19561747\paragraph{nlp\_solver:}\label{sec:nlp_solver} Choice of the solver for local optima of continuous nlp's $\;$ \\
    19571748 Note that option will work only if the specified
     
    19761767\end{itemize}
    19771768
    1978 \htmlanchor{sec:warm\_start}
    19791769\paragraph{warm\_start:}\label{sec:warm_start} Select the warm start method $\;$ \\
    19801770 This will affect the function getWarmStart(), and
     
    19851775Possible values:
    19861776\begin{itemize}
    1987    \item none: No warm start
     1777   \item none: No warm start, just start NLPs from optimal
     1778solution of the root relaxation
     1779   \item fake\_basis: builds fake basis, useful for cut management in
     1780Cbc (warm start is the same as in none)
    19881781   \item optimum: Warm start with direct parent optimum
    19891782   \item interior\_point: Warm start with an interior point of direct
  • trunk/Bonmin/doc/options_list_filter_content.tex

    r1642 r1991  
    99<td> B-QG</td>
    1010<td> B-Hyb</td>
    11 <td> B-Ecp</td>
    12 <td> B-iFP</td>
    13 <td> Cbc_D</td>
     11</tr>
     12<tr>   <th colspan=9> <a href="#sec:FilterSQP_options">FilterSQP options</a> </th>
     13</tr>
     14<tr>
     15<td> <a href="#sec:eps">eps</a> </td>
     16<td>F</td>
     17<td> +</td>
     18<td>+</td>
     19<td>+</td>
     20<td>+</td>
     21</tr>
     22<tr>
     23<td> <a href="#sec:infty">infty</a> </td>
     24<td>F</td>
     25<td> +</td>
     26<td>+</td>
     27<td>+</td>
     28<td>+</td>
     29</tr>
     30<tr>
     31<td> <a href="#sec:iprint">iprint</a> </td>
     32<td>I</td>
     33<td> +</td>
     34<td>+</td>
     35<td>+</td>
     36<td>+</td>
     37</tr>
     38<tr>
     39<td> <a href="#sec:kmax">kmax</a> </td>
     40<td>I</td>
     41<td> +</td>
     42<td>+</td>
     43<td>+</td>
     44<td>+</td>
     45</tr>
     46<tr>
     47<td> <a href="#sec:maxf">maxf</a> </td>
     48<td>I</td>
     49<td> +</td>
     50<td>+</td>
     51<td>+</td>
     52<td>+</td>
     53</tr>
     54<tr>
     55<td> <a href="#sec:maxiter">maxiter</a> </td>
     56<td>I</td>
     57<td> +</td>
     58<td>+</td>
     59<td>+</td>
     60<td>+</td>
     61</tr>
     62<tr>
     63<td> <a href="#sec:mlp">mlp</a> </td>
     64<td>I</td>
     65<td> +</td>
     66<td>+</td>
     67<td>+</td>
     68<td>+</td>
     69</tr>
     70<tr>
     71<td> <a href="#sec:mxlws">mxlws</a> </td>
     72<td>I</td>
     73<td> +</td>
     74<td>+</td>
     75<td>+</td>
     76<td>+</td>
     77</tr>
     78<tr>
     79<td> <a href="#sec:mxws">mxws</a> </td>
     80<td>I</td>
     81<td> +</td>
     82<td>+</td>
     83<td>+</td>
     84<td>+</td>
     85</tr>
     86<tr>
     87<td> <a href="#sec:rho_init">rho_init</a> </td>
     88<td>F</td>
     89<td> +</td>
     90<td>+</td>
     91<td>+</td>
     92<td>+</td>
     93</tr>
     94<tr>
     95<td> <a href="#sec:tt">tt</a> </td>
     96<td>F</td>
     97<td> +</td>
     98<td>+</td>
     99<td>+</td>
     100<td>+</td>
     101</tr>
     102<tr>
     103<td> <a href="#sec:ubd">ubd</a> </td>
     104<td>F</td>
     105<td> +</td>
     106<td>+</td>
     107<td>+</td>
     108<td>+</td>
    14109</tr>
    15110</tr>
     
    17112}
    18113}
     114\subsection{FilterSQP options}
     115\label{sec:FilterSQP_options}
     116\htmlanchor{sec:FilterSQP_options}
     117\paragraph{eps:}\label{sec:eps} Tolerance for SQP solver $\;$ \\
     118 The valid range for this real option is
     119$0 <  {\tt eps } <  {\tt +inf}$
     120and its default value is $1 \cdot 10^{-08}$.
     121
     122
     123\paragraph{infty:}\label{sec:infty} A large number (1E20) $\;$ \\
     124 The valid range for this real option is
     125$0 <  {\tt infty } <  {\tt +inf}$
     126and its default value is $1 \cdot 10^{+20}$.
     127
     128
     129\paragraph{iprint:}\label{sec:iprint} Print level (0=silent, 3=verbose) $\;$ \\
     130 The valid range for this integer option is
     131$0 \le {\tt iprint } \le 6$
     132and its default value is $0$.
     133
     134
     135\paragraph{kmax:}\label{sec:kmax} Dimension of null-space $\;$ \\
     136 The valid range for this integer option is
     137$-1 \le {\tt kmax } <  {\tt +inf}$
     138and its default value is $-1$.
     139
     140
     141\paragraph{maxf:}\label{sec:maxf} Maximum filter length $\;$ \\
     142 The valid range for this integer option is
     143$0 \le {\tt maxf } <  {\tt +inf}$
     144and its default value is $100$.
     145
     146
     147\paragraph{maxiter:}\label{sec:maxiter} Maximum number of iterations $\;$ \\
     148 The valid range for this integer option is
     149$0 \le {\tt maxiter } <  {\tt +inf}$
     150and its default value is $1000$.
     151
     152
     153\paragraph{mlp:}\label{sec:mlp} Maximum level for degeneracy (bqpd) $\;$ \\
     154 The valid range for this integer option is
     155$0 \le {\tt mlp } <  {\tt +inf}$
     156and its default value is $1000$.
     157
     158
     159\paragraph{mxlws:}\label{sec:mxlws} FINTEGER workspace increment $\;$ \\
     160 The valid range for this integer option is
     161$0 \le {\tt mxlws } <  {\tt +inf}$
     162and its default value is $500000$.
     163
     164
     165\paragraph{mxws:}\label{sec:mxws} REAL workspace increment $\;$ \\
     166 The valid range for this integer option is
     167$0 \le {\tt mxws } <  {\tt +inf}$
     168and its default value is $2000000$.
     169
     170
     171\paragraph{rho\_init:}\label{sec:rho_init} Initial trust region size $\;$ \\
     172 The valid range for this real option is
     173$0 <  {\tt rho\_init } <  {\tt +inf}$
     174and its default value is $10$.
     175
     176
     177\paragraph{tt:}\label{sec:tt} Parameter for upper bound on filter $\;$ \\
     178 The valid range for this real option is
     179$0 <  {\tt tt } <  {\tt +inf}$
     180and its default value is $1.25$.
     181
     182
     183\paragraph{ubd:}\label{sec:ubd} Parameter for upper bound on filter $\;$ \\
     184 The valid range for this real option is
     185$0 <  {\tt ubd } <  {\tt +inf}$
     186and its default value is $100$.
     187
     188
  • trunk/Bonmin/doc/options_list_ipopt_content.tex

    r1642 r1991  
    99<td> B-QG</td>
    1010<td> B-Hyb</td>
    11 <td> B-Ecp</td>
    12 <td> B-iFP</td>
    13 <td> Cbc_D</td>
    1411</tr>
    1512<tr>
     
    2017<td>+</td>
    2118<td>+</td>
    22 <td>+</td>
    23 <td>+</td>
    24 <td>+</td>
    2519</tr>
    2620<tr>   <th colspan=9> <a href="#sec:Barrier_Parameter_Update">Barrier Parameter Update</a> </th>
     
    3327<td>+</td>
    3428<td>+</td>
    35 <td>+</td>
    36 <td>+</td>
    37 <td>+</td>
    3829</tr>
    3930<tr>
     
    4435<td>+</td>
    4536<td>+</td>
    46 <td>+</td>
    47 <td>+</td>
    48 <td>+</td>
    4937</tr>
    5038<tr>
     
    5240<td>F</td>
    5341<td> +</td>
    54 <td>+</td>
    55 <td>+</td>
    56 <td>+</td>
    5742<td>+</td>
    5843<td>+</td>
     
    6651<td>+</td>
    6752<td>+</td>
    68 <td>+</td>
    69 <td>+</td>
    70 <td>+</td>
    7153</tr>
    7254<tr>
     
    7759<td>+</td>
    7860<td>+</td>
    79 <td>+</td>
    80 <td>+</td>
    81 <td>+</td>
    8261</tr>
    8362<tr>
     
    8867<td>+</td>
    8968<td>+</td>
    90 <td>+</td>
    91 <td>+</td>
    92 <td>+</td>
    9369</tr>
    9470<tr>
     
    9975<td>+</td>
    10076<td>+</td>
    101 <td>+</td>
    102 <td>+</td>
    103 <td>+</td>
    10477</tr>
    10578<tr>
     
    11083<td>+</td>
    11184<td>+</td>
    112 <td>+</td>
    113 <td>+</td>
    114 <td>+</td>
    11585</tr>
    11686<tr>
     
    12191<td>+</td>
    12292<td>+</td>
    123 <td>+</td>
    124 <td>+</td>
    125 <td>+</td>
    12693</tr>
    12794<tr>
     
    13299<td>+</td>
    133100<td>+</td>
    134 <td>+</td>
    135 <td>+</td>
    136 <td>+</td>
    137101</tr>
    138102<tr>
     
    143107<td>+</td>
    144108<td>+</td>
    145 <td>+</td>
    146 <td>+</td>
    147 <td>+</td>
    148109</tr>
    149110<tr>
     
    154115<td>+</td>
    155116<td>+</td>
    156 <td>+</td>
    157 <td>+</td>
    158 <td>+</td>
    159117</tr>
    160118<tr>
     
    165123<td>+</td>
    166124<td>+</td>
    167 <td>+</td>
    168 <td>+</td>
    169 <td>+</td>
    170125</tr>
    171126<tr>
     
    176131<td>+</td>
    177132<td>+</td>
    178 <td>+</td>
    179 <td>+</td>
    180 <td>+</td>
    181133</tr>
    182134<tr>
     
    187139<td>+</td>
    188140<td>+</td>
    189 <td>+</td>
    190 <td>+</td>
    191 <td>+</td>
    192141</tr>
    193142<tr>
     
    198147<td>+</td>
    199148<td>+</td>
    200 <td>+</td>
    201 <td>+</td>
    202 <td>+</td>
    203149</tr>
    204150<tr>
     
    209155<td>+</td>
    210156<td>+</td>
    211 <td>+</td>
    212 <td>+</td>
    213 <td>+</td>
    214157</tr>
    215158<tr>
     
    220163<td>+</td>
    221164<td>+</td>
    222 <td>+</td>
    223 <td>+</td>
    224 <td>+</td>
    225165</tr>
    226166<tr>
     
    231171<td>+</td>
    232172<td>+</td>
    233 <td>+</td>
    234 <td>+</td>
    235 <td>+</td>
    236173</tr>
    237174<tr>
     
    242179<td>+</td>
    243180<td>+</td>
    244 <td>+</td>
    245 <td>+</td>
    246 <td>+</td>
    247181</tr>
    248182<tr>
     
    250184<td>S</td>
    251185<td> +</td>
    252 <td>+</td>
    253 <td>+</td>
    254 <td>+</td>
    255186<td>+</td>
    256187<td>+</td>
     
    264195<td>+</td>
    265196<td>+</td>
    266 <td>+</td>
    267 <td>+</td>
    268 <td>+</td>
    269197</tr>
    270198<tr>
     
    275203<td>+</td>
    276204<td>+</td>
    277 <td>+</td>
    278 <td>+</td>
    279 <td>+</td>
    280205</tr>
    281206<tr>
     
    286211<td>+</td>
    287212<td>+</td>
    288 <td>+</td>
    289 <td>+</td>
    290 <td>+</td>
    291213</tr>
    292214<tr>
     
    297219<td>+</td>
    298220<td>+</td>
    299 <td>+</td>
    300 <td>+</td>
    301 <td>+</td>
    302221</tr>
    303222<tr>
     
    308227<td>+</td>
    309228<td>+</td>
    310 <td>+</td>
    311 <td>+</td>
    312 <td>+</td>
    313229</tr>
    314230<tr>
     
    319235<td>+</td>
    320236<td>+</td>
    321 <td>+</td>
    322 <td>+</td>
    323 <td>+</td>
    324237</tr>
    325238<tr>
     
    330243<td>+</td>
    331244<td>+</td>
    332 <td>+</td>
    333 <td>+</td>
    334 <td>+</td>
    335245</tr>
    336246<tr>   <th colspan=9> <a href="#sec:Convergence">Convergence</a> </th>
     
    343253<td>+</td>
    344254<td>+</td>
    345 <td>+</td>
    346 <td>+</td>
    347 <td>+</td>
    348255</tr>
    349256<tr>
     
    354261<td>+</td>
    355262<td>+</td>
    356 <td>+</td>
    357 <td>+</td>
    358 <td>+</td>
    359263</tr>
    360264<tr>
     
    362266<td>F</td>
    363267<td> +</td>
    364 <td>+</td>
    365 <td>+</td>
    366 <td>+</td>
    367268<td>+</td>
    368269<td>+</td>
     
    376277<td>+</td>
    377278<td>+</td>
    378 <td>+</td>
    379 <td>+</td>
    380 <td>+</td>
    381279</tr>
    382280<tr>
     
    387285<td>+</td>
    388286<td>+</td>
    389 <td>+</td>
    390 <td>+</td>
    391 <td>+</td>
    392287</tr>
    393288<tr>
     
    398293<td>+</td>
    399294<td>+</td>
    400 <td>+</td>
    401 <td>+</td>
    402 <td>+</td>
    403295</tr>
    404296<tr>
     
    409301<td>+</td>
    410302<td>+</td>
    411 <td>+</td>
    412 <td>+</td>
    413 <td>+</td>
    414303</tr>
    415304<tr>
     
    420309<td>+</td>
    421310<td>+</td>
    422 <td>+</td>
    423 <td>+</td>
    424 <td>+</td>
    425311</tr>
    426312<tr>
     
    431317<td>+</td>
    432318<td>+</td>
    433 <td>+</td>
    434 <td>+</td>
    435 <td>+</td>
    436319</tr>
    437320<tr>
     
    442325<td>+</td>
    443326<td>+</td>
    444 <td>+</td>
    445 <td>+</td>
    446 <td>+</td>
    447327</tr>
    448328<tr>
     
    450330<td>F</td>
    451331<td> +</td>
    452 <td>+</td>
    453 <td>+</td>
    454 <td>+</td>
    455332<td>+</td>
    456333<td>+</td>
     
    464341<td>+</td>
    465342<td>+</td>
     343</tr>
     344<tr>
     345<td> <a href="#sec:mu_target">mu_target</a> </td>
     346<td>F</td>
     347<td> +</td>
    466348<td>+</td>
    467349<td>+</td>
     
    475357<td>+</td>
    476358<td>+</td>
    477 <td>+</td>
    478 <td>+</td>
    479 <td>+</td>
    480359</tr>
    481360<tr>
     
    486365<td>+</td>
    487366<td>+</td>
    488 <td>+</td>
    489 <td>+</td>
    490 <td>+</td>
    491367</tr>
    492368<tr>   <th colspan=9> <a href="#sec:Derivative_Checker">Derivative Checker</a> </th>
     
    496372<td>S</td>
    497373<td> +</td>
    498 <td>+</td>
    499 <td>+</td>
    500 <td>+</td>
    501374<td>+</td>
    502375<td>+</td>
     
    510383<td>+</td>
    511384<td>+</td>
    512 <td>+</td>
    513 <td>+</td>
    514 <td>+</td>
    515385</tr>
    516386<tr>
     
    521391<td>+</td>
    522392<td>+</td>
    523 <td>+</td>
    524 <td>+</td>
    525 <td>+</td>
    526393</tr>
    527394<tr>
     
    532399<td>+</td>
    533400<td>+</td>
    534 <td>+</td>
    535 <td>+</td>
    536 <td>+</td>
    537401</tr>
    538402<tr>
     
    543407<td>+</td>
    544408<td>+</td>
    545 <td>+</td>
    546 <td>+</td>
    547 <td>+</td>
    548409</tr>
    549410<tr>
     
    554415<td>+</td>
    555416<td>+</td>
    556 <td>+</td>
    557 <td>+</td>
    558 <td>+</td>
    559417</tr>
    560418<tr>
     
    565423<td>+</td>
    566424<td>+</td>
    567 <td>+</td>
    568 <td>+</td>
    569 <td>+</td>
    570425</tr>
    571426<tr>
     
    576431<td>+</td>
    577432<td>+</td>
    578 <td>+</td>
    579 <td>+</td>
    580 <td>+</td>
    581433</tr>
    582434<tr>   <th colspan=9> <a href="#sec:Hessian_Approximation">Hessian Approximation</a> </th>
     
    589441<td>+</td>
    590442<td>+</td>
    591 <td>+</td>
    592 <td>+</td>
    593 <td>+</td>
    594443</tr>
    595444<tr>
     
    600449<td>+</td>
    601450<td>+</td>
     451</tr>
     452<tr>
     453<td> <a href="#sec:limited_memory_aug_solver">limited_memory_aug_solver</a> </td>
     454<td>S</td>
     455<td> +</td>
    602456<td>+</td>
    603457<td>+</td>
     
    611465<td>+</td>
    612466<td>+</td>
    613 <td>+</td>
    614 <td>+</td>
    615 <td>+</td>
    616467</tr>
    617468<tr>
     
    622473<td>+</td>
    623474<td>+</td>
    624 <td>+</td>
    625 <td>+</td>
    626 <td>+</td>
    627475</tr>
    628476<tr>
     
    633481<td>+</td>
    634482<td>+</td>
    635 <td>+</td>
    636 <td>+</td>
    637 <td>+</td>
    638483</tr>
    639484<tr>
     
    641486<td>S</td>
    642487<td> +</td>
    643 <td>+</td>
    644 <td>+</td>
    645 <td>+</td>
    646488<td>+</td>
    647489<td>+</td>
     
    655497<td>+</td>
    656498<td>+</td>
    657 <td>+</td>
    658 <td>+</td>
    659 <td>+</td>
    660499</tr>
    661500<tr>
     
    666505<td>+</td>
    667506<td>+</td>
     507</tr>
     508<tr>
     509<td> <a href="#sec:limited_memory_special_for_resto">limited_memory_special_for_resto</a> </td>
     510<td>S</td>
     511<td> +</td>
    668512<td>+</td>
    669513<td>+</td>
     
    677521<td>+</td>
    678522<td>+</td>
    679 <td>+</td>
    680 <td>+</td>
    681 <td>+</td>
    682523</tr>
    683524<tr>   <th colspan=9> <a href="#sec:Initialization">Initialization</a> </th>
     
    690531<td>+</td>
    691532<td>+</td>
    692 <td>+</td>
    693 <td>+</td>
    694 <td>+</td>
    695533</tr>
    696534<tr>
     
    701539<td>+</td>
    702540<td>+</td>
    703 <td>+</td>
    704 <td>+</td>
    705 <td>+</td>
    706541</tr>
    707542<tr>
     
    712547<td>+</td>
    713548<td>+</td>
    714 <td>+</td>
    715 <td>+</td>
    716 <td>+</td>
    717549</tr>
    718550<tr>
     
    723555<td>+</td>
    724556<td>+</td>
    725 <td>+</td>
    726 <td>+</td>
    727 <td>+</td>
    728557</tr>
    729558<tr>
     
    734563<td>+</td>
    735564<td>+</td>
    736 <td>+</td>
    737 <td>+</td>
    738 <td>+</td>
    739565</tr>
    740566<tr>
     
    745571<td>+</td>
    746572<td>+</td>
    747 <td>+</td>
    748 <td>+</td>
    749 <td>+</td>
    750573</tr>
    751574<tr>
     
    756579<td>+</td>
    757580<td>+</td>
    758 <td>+</td>
    759 <td>+</td>
    760 <td>+</td>
    761581</tr>
    762582<tr>
     
    767587<td>+</td>
    768588<td>+</td>
    769 <td>+</td>
    770 <td>+</td>
    771 <td>+</td>
    772589</tr>
    773590<tr>
     
    775592<td>F</td>
    776593<td> +</td>
    777 <td>+</td>
    778 <td>+</td>
    779 <td>+</td>
    780594<td>+</td>
    781595<td>+</td>
     
    791605<td>+</td>
    792606<td>+</td>
    793 <td>+</td>
    794 <td>+</td>
    795 <td>+</td>
    796607</tr>
    797608<tr>
     
    802613<td>+</td>
    803614<td>+</td>
    804 <td>+</td>
    805 <td>+</td>
    806 <td>+</td>
    807615</tr>
    808616<tr>
     
    813621<td>+</td>
    814622<td>+</td>
    815 <td>+</td>
    816 <td>+</td>
    817 <td>+</td>
    818623</tr>
    819624<tr>
     
    824629<td>+</td>
    825630<td>+</td>
    826 <td>+</td>
    827 <td>+</td>
    828 <td>+</td>
    829631</tr>
    830632<tr>
     
    835637<td>+</td>
    836638<td>+</td>
    837 <td>+</td>
    838 <td>+</td>
    839 <td>+</td>
    840639</tr>
    841640<tr>
     
    846645<td>+</td>
    847646<td>+</td>
     647</tr>
     648<tr>
     649<td> <a href="#sec:constraint_violation_norm_type">constraint_violation_norm_type</a> </td>
     650<td>S</td>
     651<td> +</td>
    848652<td>+</td>
    849653<td>+</td>
     
    857661<td>+</td>
    858662<td>+</td>
    859 <td>+</td>
    860 <td>+</td>
    861 <td>+</td>
    862663</tr>
    863664<tr>
     
    868669<td>+</td>
    869670<td>+</td>
    870 <td>+</td>
    871 <td>+</td>
    872 <td>+</td>
    873671</tr>
    874672<tr>
     
    879677<td>+</td>
    880678<td>+</td>
    881 <td>+</td>
    882 <td>+</td>
    883 <td>+</td>
    884679</tr>
    885680<tr>
     
    887682<td>F</td>
    888683<td> +</td>
    889 <td>+</td>
    890 <td>+</td>
    891 <td>+</td>
    892684<td>+</td>
    893685<td>+</td>
     
    901693<td>+</td>
    902694<td>+</td>
    903 <td>+</td>
    904 <td>+</td>
    905 <td>+</td>
    906695</tr>
    907696<tr>
     
    912701<td>+</td>
    913702<td>+</td>
    914 <td>+</td>
    915 <td>+</td>
    916 <td>+</td>
    917703</tr>
    918704<tr>
     
    923709<td>+</td>
    924710<td>+</td>
    925 <td>+</td>
    926 <td>+</td>
    927 <td>+</td>
    928711</tr>
    929712<tr>
     
    934717<td>+</td>
    935718<td>+</td>
    936 <td>+</td>
    937 <td>+</td>
    938 <td>+</td>
    939719</tr>
    940720<tr>
     
    945725<td>+</td>
    946726<td>+</td>
     727</tr>
     728<tr>
     729<td> <a href="#sec:line_search_method">line_search_method</a> </td>
     730<td>S</td>
     731<td> +</td>
    947732<td>+</td>
    948733<td>+</td>
     
    956741<td>+</td>
    957742<td>+</td>
    958 <td>+</td>
    959 <td>+</td>
    960 <td>+</td>
    961743</tr>
    962744<tr>
     
    967749<td>+</td>
    968750<td>+</td>
    969 <td>+</td>
    970 <td>+</td>
    971 <td>+</td>
    972751</tr>
    973752<tr>
     
    978757<td>+</td>
    979758<td>+</td>
    980 <td>+</td>
    981 <td>+</td>
    982 <td>+</td>
    983759</tr>
    984760<tr>
     
    989765<td>+</td>
    990766<td>+</td>
    991 <td>+</td>
    992 <td>+</td>
    993 <td>+</td>
    994767</tr>
    995768<tr>
     
    1000773<td>+</td>
    1001774<td>+</td>
    1002 <td>+</td>
    1003 <td>+</td>
    1004 <td>+</td>
    1005775</tr>
    1006776<tr>
     
    1011781<td>+</td>
    1012782<td>+</td>
    1013 <td>+</td>
    1014 <td>+</td>
    1015 <td>+</td>
    1016783</tr>
    1017784<tr>
     
    1022789<td>+</td>
    1023790<td>+</td>
    1024 <td>+</td>
    1025 <td>+</td>
    1026 <td>+</td>
    1027791</tr>
    1028792<tr>
     
    1033797<td>+</td>
    1034798<td>+</td>
    1035 <td>+</td>
    1036 <td>+</td>
    1037 <td>+</td>
    1038799</tr>
    1039800<tr>
     
    1044805<td>+</td>
    1045806<td>+</td>
    1046 <td>+</td>
    1047 <td>+</td>
    1048 <td>+</td>
    1049807</tr>
    1050808<tr>
     
    1055813<td>+</td>
    1056814<td>+</td>
    1057 <td>+</td>
    1058 <td>+</td>
    1059 <td>+</td>
    1060815</tr>
    1061816<tr>
     
    1066821<td>+</td>
    1067822<td>+</td>
    1068 <td>+</td>
    1069 <td>+</td>
    1070 <td>+</td>
    1071823</tr>
    1072824<tr>
     
    1077829<td>+</td>
    1078830<td>+</td>
    1079 <td>+</td>
    1080 <td>+</td>
    1081 <td>+</td>
    1082831</tr>
    1083832<tr>
     
    1088837<td>+</td>
    1089838<td>+</td>
    1090 <td>+</td>
    1091 <td>+</td>
    1092 <td>+</td>
    1093839</tr>
    1094840<tr>
     
    1099845<td>+</td>
    1100846<td>+</td>
    1101 <td>+</td>
    1102 <td>+</td>
    1103 <td>+</td>
    1104847</tr>
    1105848<tr>
     
    1110853<td>+</td>
    1111854<td>+</td>
    1112 <td>+</td>
    1113 <td>+</td>
    1114 <td>+</td>
    1115855</tr>
    1116856<tr>
     
    1121861<td>+</td>
    1122862<td>+</td>
    1123 <td>+</td>
    1124 <td>+</td>
    1125 <td>+</td>
    1126863</tr>
    1127864<tr>
     
    1129866<td>F</td>
    1130867<td> +</td>
    1131 <td>+</td>
    1132 <td>+</td>
    1133 <td>+</td>
    1134868<td>+</td>
    1135869<td>+</td>
     
    1143877<td>+</td>
    1144878<td>+</td>
    1145 <td>+</td>
    1146 <td>+</td>
    1147 <td>+</td>
    1148879</tr>
    1149880<tr>
     
    1154885<td>+</td>
    1155886<td>+</td>
    1156 <td>+</td>
    1157 <td>+</td>
    1158 <td>+</td>
    1159 </tr>
    1160 <tr>   <th colspan=9> <a href="#sec:Line_search">Line search</a> </th>
    1161 </tr>
    1162 <tr>
    1163 <td> <a href="#sec:constraint_violation_norm_type">constraint_violation_norm_type</a> </td>
    1164 <td>S</td>
    1165 <td> +</td>
    1166 <td>+</td>
    1167 <td>+</td>
    1168 <td>+</td>
    1169 <td>+</td>
    1170 <td>+</td>
    1171 <td>+</td>
    1172887</tr>
    1173888<tr>   <th colspan=9> <a href="#sec:Linear_Solver">Linear Solver</a> </th>
     
    1180895<td>+</td>
    1181896<td>+</td>
    1182 <td>+</td>
    1183 <td>+</td>
    1184 <td>+</td>
    1185897</tr>
    1186898<tr>
     
    1191903<td>+</td>
    1192904<td>+</td>
    1193 <td>+</td>
    1194 <td>+</td>
    1195 <td>+</td>
    1196905</tr>
    1197906<tr>
     
    1202911<td>+</td>
    1203912<td>+</td>
    1204 <td>+</td>
    1205 <td>+</td>
    1206 <td>+</td>
    1207913</tr>
    1208914<tr>   <th colspan=9> <a href="#sec:MA27_Linear_Solver">MA27 Linear Solver</a> </th>
     
    1215921<td>+</td>
    1216922<td>+</td>
    1217 <td>+</td>
    1218 <td>+</td>
    1219 <td>+</td>
    1220923</tr>
    1221924<tr>
     
    1226929<td>+</td>
    1227930<td>+</td>
    1228 <td>+</td>
    1229 <td>+</td>
    1230 <td>+</td>
    1231931</tr>
    1232932<tr>
     
    1237937<td>+</td>
    1238938<td>+</td>
    1239 <td>+</td>
    1240 <td>+</td>
    1241 <td>+</td>
    1242939</tr>
    1243940<tr>
     
    1248945<td>+</td>
    1249946<td>+</td>
    1250 <td>+</td>
    1251 <td>+</td>
    1252 <td>+</td>
    1253947</tr>
    1254948<tr>
     
    1259953<td>+</td>
    1260954<td>+</td>
    1261 <td>+</td>
    1262 <td>+</td>
    1263 <td>+</td>
    1264955</tr>
    1265956<tr>
     
    1270961<td>+</td>
    1271962<td>+</td>
    1272 <td>+</td>
    1273 <td>+</td>
    1274 <td>+</td>
    1275963</tr>
    1276964<tr>
     
    1281969<td>+</td>
    1282970<td>+</td>
    1283 <td>+</td>
    1284 <td>+</td>
    1285 <td>+</td>
    1286971</tr>
    1287972<tr>   <th colspan=9> <a href="#sec:MA28_Linear_Solver">MA28 Linear Solver</a> </th>
     
    1294979<td>+</td>
    1295980<td>+</td>
    1296 <td>+</td>
    1297 <td>+</td>
    1298 <td>+</td>
    1299981</tr>
    1300982<tr>   <th colspan=9> <a href="#sec:MA57_Linear_Solver">MA57 Linear Solver</a> </th>
     983</tr>
     984<tr>
     985<td> <a href="#sec:ma57_automatic_scaling">ma57_automatic_scaling</a> </td>
     986<td>S</td>
     987<td> +</td>
     988<td>+</td>
     989<td>+</td>
     990<td>+</td>
     991</tr>
     992<tr>
     993<td> <a href="#sec:ma57_block_size">ma57_block_size</a> </td>
     994<td>I</td>
     995<td> +</td>
     996<td>+</td>
     997<td>+</td>
     998<td>+</td>
     999</tr>
     1000<tr>
     1001<td> <a href="#sec:ma57_node_amalgamation">ma57_node_amalgamation</a> </td>
     1002<td>I</td>
     1003<td> +</td>
     1004<td>+</td>
     1005<td>+</td>
     1006<td>+</td>
    13011007</tr>
    13021008<tr>
     
    13071013<td>+</td>
    13081014<td>+</td>
    1309 <td>+</td>
    1310 <td>+</td>
    1311 <td>+</td>
    13121015</tr>
    13131016<tr>
     
    13181021<td>+</td>
    13191022<td>+</td>
    1320 <td>+</td>
    1321 <td>+</td>
    1322 <td>+</td>
    13231023</tr>
    13241024<tr>
     
    13291029<td>+</td>
    13301030<td>+</td>
    1331 <td>+</td>
    1332 <td>+</td>
    1333 <td>+</td>
    13341031</tr>
    13351032<tr>
     
    13401037<td>+</td>
    13411038<td>+</td>
     1039</tr>
     1040<tr>
     1041<td> <a href="#sec:ma57_small_pivot_flag">ma57_small_pivot_flag</a> </td>
     1042<td>I</td>
     1043<td> +</td>
     1044<td>+</td>
     1045<td>+</td>
     1046<td>+</td>
     1047</tr>
     1048<tr>   <th colspan=9> <a href="#sec:MA86_Linear_Solver">MA86 Linear Solver</a> </th>
     1049</tr>
     1050<tr>
     1051<td> <a href="#sec:ma86_nemin">ma86_nemin</a> </td>
     1052<td>I</td>
     1053<td> +</td>
     1054<td>+</td>
     1055<td>+</td>
     1056<td>+</td>
     1057</tr>
     1058<tr>
     1059<td> <a href="#sec:ma86_order">ma86_order</a> </td>
     1060<td>S</td>
     1061<td> +</td>
     1062<td>+</td>
     1063<td>+</td>
     1064<td>+</td>
     1065</tr>
     1066<tr>
     1067<td> <a href="#sec:ma86_print_level">ma86_print_level</a> </td>
     1068<td>I</td>
     1069<td> +</td>
     1070<td>+</td>
     1071<td>+</td>
     1072<td>+</td>
     1073</tr>
     1074<tr>
     1075<td> <a href="#sec:ma86_scaling">ma86_scaling</a> </td>
     1076<td>S</td>
     1077<td> +</td>
     1078<td>+</td>
     1079<td>+</td>
     1080<td>+</td>
     1081</tr>
     1082<tr>
     1083<td> <a href="#sec:ma86_small">ma86_small</a> </td>
     1084<td>F</td>
     1085<td> +</td>
     1086<td>+</td>
     1087<td>+</td>
     1088<td>+</td>
     1089</tr>
     1090<tr>
     1091<td> <a href="#sec:ma86_static">ma86_static</a> </td>
     1092<td>F</td>
     1093<td> +</td>
     1094<td>+</td>
     1095<td>+</td>
     1096<td>+</td>
     1097</tr>
     1098<tr>
     1099<td> <a href="#sec:ma86_u">ma86_u</a> </td>
     1100<td>F</td>
     1101<td> +</td>
     1102<td>+</td>
     1103<td>+</td>
     1104<td>+</td>
     1105</tr>
     1106<tr>
     1107<td> <a href="#sec:ma86_umax">ma86_umax</a> </td>
     1108<td>F</td>
     1109<td> +</td>
    13421110<td>+</td>
    13431111<td>+</td>
     
    13501118<td>F</td>
    13511119<td> +</td>
    1352 <td>+</td>
    1353 <td>+</td>
    1354 <td>+</td>
    13551120<td>+</td>
    13561121<td>+</td>
     
    13641129<td>+</td>
    13651130<td>+</td>
    1366 <td>+</td>
    1367 <td>+</td>
    1368 <td>+</td>
    13691131</tr>
    13701132<tr>
     
    13751137<td>+</td>
    13761138<td>+</td>
    1377 <td>+</td>
    1378 <td>+</td>
    1379 <td>+</td>
    13801139</tr>
    13811140<tr>
     
    13861145<td>+</td>
    13871146<td>+</td>
    1388 <td>+</td>
    1389 <td>+</td>
    1390 <td>+</td>
    13911147</tr>
    13921148<tr>
     
    13971153<td>+</td>
    13981154<td>+</td>
    1399 <td>+</td>
    1400 <td>+</td>
    1401 <td>+</td>
    14021155</tr>
    14031156<tr>
     
    14051158<td>F</td>
    14061159<td> +</td>
    1407 <td>+</td>
    1408 <td>+</td>
    1409 <td>+</td>
    14101160<td>+</td>
    14111161<td>+</td>
     
    14191169<td>+</td>
    14201170<td>+</td>
    1421 <td>+</td>
    1422 <td>+</td>
    1423 <td>+</td>
    14241171</tr>
    14251172<tr>   <th colspan=9> <a href="#sec:NLP">NLP</a> </th>
     
    14321179<td>+</td>
    14331180<td>+</td>
    1434 <td>+</td>
    1435 <td>+</td>
    1436 <td>+</td>
    14371181</tr>
    14381182<tr>
     
    14431187<td>+</td>
    14441188<td>+</td>
    1445 <td>+</td>
    1446 <td>+</td>
    1447 <td>+</td>
    14481189</tr>
    14491190<tr>
     
    14541195<td>+</td>
    14551196<td>+</td>
    1456 <td>+</td>
    1457 <td>+</td>
    1458 <td>+</td>
    14591197</tr>
    14601198<tr>
     
    14651203<td>+</td>
    14661204<td>+</td>
    1467 <td>+</td>
    1468 <td>+</td>
    1469 <td>+</td>
    14701205</tr>
    14711206<tr>
     
    14761211<td>+</td>
    14771212<td>+</td>
    1478 <td>+</td>
    1479 <td>+</td>
    1480 <td>+</td>
    14811213</tr>
    14821214<tr>
     
    14871219<td>+</td>
    14881220<td>+</td>
    1489 <td>+</td>
    1490 <td>+</td>
    1491 <td>+</td>
    14921221</tr>
    14931222<tr>
     
    14981227<td>+</td>
    14991228<td>+</td>
    1500 <td>+</td>
    1501 <td>+</td>
    1502 <td>+</td>
    15031229</tr>
    15041230<tr>
     
    15091235<td>+</td>
    15101236<td>+</td>
    1511 <td>+</td>
    1512 <td>+</td>
    1513 <td>+</td>
    15141237</tr>
    15151238<tr>
     
    15201243<td>+</td>
    15211244<td>+</td>
    1522 <td>+</td>
    1523 <td>+</td>
    1524 <td>+</td>
    15251245</tr>
    15261246<tr>
     
    15311251<td>+</td>
    15321252<td>+</td>
    1533 <td>+</td>
    1534 <td>+</td>
    1535 <td>+</td>
    15361253</tr>
    15371254<tr>
     
    15421259<td>+</td>
    15431260<td>+</td>
    1544 <td>+</td>
    1545 <td>+</td>
    1546 <td>+</td>
    15471261</tr>
    15481262<tr>
     
    15501264<td>F</td>
    15511265<td> +</td>
    1552 <td>+</td>
    1553 <td>+</td>
    1554 <td>+</td>
    15551266<td>+</td>
    15561267<td>+</td>
     
    15641275<td>+</td>
    15651276<td>+</td>
    1566 <td>+</td>
    1567 <td>+</td>
    1568 <td>+</td>
    15691277</tr>
    15701278<tr>   <th colspan=9> <a href="#sec:NLP_Scaling">NLP Scaling</a> </th>
     
    15771285<td>+</td>
    15781286<td>+</td>
    1579 <td>+</td>
    1580 <td>+</td>
    1581 <td>+</td>
    15821287</tr>
    15831288<tr>
     
    15881293<td>+</td>
    15891294<td>+</td>
    1590 <td>+</td>
    1591 <td>+</td>
    1592 <td>+</td>
    15931295</tr>
    15941296<tr>
     
    15991301<td>+</td>
    16001302<td>+</td>
     1303</tr>
     1304<tr>
     1305<td> <a href="#sec:nlp_scaling_min_value">nlp_scaling_min_value</a> </td>
     1306<td>F</td>
     1307<td> +</td>
    16011308<td>+</td>
    16021309<td>+</td>
     
    16101317<td>+</td>
    16111318<td>+</td>
    1612 <td>+</td>
    1613 <td>+</td>
    1614 <td>+</td>
    16151319</tr>
    16161320<tr>
     
    16181322<td>F</td>
    16191323<td> +</td>
    1620 <td>+</td>
    1621 <td>+</td>
    1622 <td>+</td>
    16231324<td>+</td>
    16241325<td>+</td>
     
    16341335<td>+</td>
    16351336<td>+</td>
     1337</tr>
     1338<tr>
     1339<td> <a href="#sec:inf_pr_output">inf_pr_output</a> </td>
     1340<td>S</td>
     1341<td> +</td>
    16361342<td>+</td>
    16371343<td>+</td>
     
    16451351<td>+</td>
    16461352<td>+</td>
    1647 <td>+</td>
    1648 <td>+</td>
    1649 <td>+</td>
    16501353</tr>
    16511354<tr>
     
    16561359<td>+</td>
    16571360<td>+</td>
    1658 <td>+</td>
    1659 <td>+</td>
    1660 <td>+</td>
    16611361</tr>
    16621362<tr>
     
    16641364<td>S</td>
    16651365<td> +</td>
    1666 <td>+</td>
    1667 <td>+</td>
    1668 <td>+</td>
    16691366<td>+</td>
    16701367<td>+</td>
     
    16781375<td>+</td>
    16791376<td>+</td>
    1680 <td>+</td>
    1681 <td>+</td>
    1682 <td>+</td>
    16831377</tr>
    16841378<tr>
     
    16891383<td>+</td>
    16901384<td>+</td>
    1691 <td>+</td>
    1692 <td>+</td>
    1693 <td>+</td>
    16941385</tr>
    16951386<tr>
     
    17001391<td>+</td>
    17011392<td>+</td>
    1702 <td>+</td>
    1703 <td>+</td>
    1704 <td>+</td>
    17051393</tr>
    17061394<tr>
     
    17111399<td>+</td>
    17121400<td>+</td>
    1713 <td>+</td>
    1714 <td>+</td>
    1715 <td>+</td>
    17161401</tr>
    17171402<tr>
     
    17221407<td>+</td>
    17231408<td>+</td>
    1724 <td>+</td>
    1725 <td>+</td>
    1726 <td>+</td>
    17271409</tr>
    17281410<tr>
     
    17301412<td>S</td>
    17311413<td> +</td>
    1732 <td>+</td>
    1733 <td>+</td>
    1734 <td>+</td>
    17351414<td>+</td>
    17361415<td>+</td>
     
    17461425<td>+</td>
    17471426<td>+</td>
    1748 <td>+</td>
    1749 <td>+</td>
    1750 <td>+</td>
    17511427</tr>
    17521428<tr>
     
    17571433<td>+</td>
    17581434<td>+</td>
    1759 <td>+</td>
    1760 <td>+</td>
    1761 <td>+</td>
    17621435</tr>
    17631436<tr>
     
    17681441<td>+</td>
    17691442<td>+</td>
    1770 <td>+</td>
    1771 <td>+</td>
    1772 <td>+</td>
    17731443</tr>
    17741444<tr>
     
    17761446<td>F</td>
    17771447<td> +</td>
    1778 <td>+</td>
    1779 <td>+</td>
    1780 <td>+</td>
    17811448<td>+</td>
    17821449<td>+</td>
     
    17901457<td>+</td>
    17911458<td>+</td>
    1792 <td>+</td>
    1793 <td>+</td>
    1794 <td>+</td>
    17951459</tr>
    17961460<tr>
     
    18011465<td>+</td>
    18021466<td>+</td>
    1803 <td>+</td>
    1804 <td>+</td>
    1805 <td>+</td>
    18061467</tr>
    18071468<tr>
     
    18121473<td>+</td>
    18131474<td>+</td>
    1814 <td>+</td>
    1815 <td>+</td>
    1816 <td>+</td>
    18171475</tr>
    18181476<tr>
     
    18231481<td>+</td>
    18241482<td>+</td>
    1825 <td>+</td>
    1826 <td>+</td>
    1827 <td>+</td>
    18281483</tr>
    18291484<tr>
     
    18311486<td>S</td>
    18321487<td> +</td>
    1833 <td>+</td>
    1834 <td>+</td>
    1835 <td>+</td>
    18361488<td>+</td>
    18371489<td>+</td>
     
    18451497<td>+</td>
    18461498<td>+</td>
    1847 <td>+</td>
    1848 <td>+</td>
    1849 <td>+</td>
    18501499</tr>
    18511500<tr>
     
    18561505<td>+</td>
    18571506<td>+</td>
    1858 <td>+</td>
    1859 <td>+</td>
    1860 <td>+</td>
    18611507</tr>
    18621508<tr>
     
    18671513<td>+</td>
    18681514<td>+</td>
    1869 <td>+</td>
    1870 <td>+</td>
    1871 <td>+</td>
    18721515</tr>
    18731516<tr>
     
    18781521<td>+</td>
    18791522<td>+</td>
    1880 <td>+</td>
    1881 <td>+</td>
    1882 <td>+</td>
    18831523</tr>
    18841524<tr>
     
    18891529<td>+</td>
    18901530<td>+</td>
    1891 <td>+</td>
    1892 <td>+</td>
    1893 <td>+</td>
    18941531</tr>
    18951532<tr>
     
    19001537<td>+</td>
    19011538<td>+</td>
    1902 <td>+</td>
    1903 <td>+</td>
    1904 <td>+</td>
    19051539</tr>
    19061540<tr>
     
    19111545<td>+</td>
    19121546<td>+</td>
    1913 <td>+</td>
    1914 <td>+</td>
    1915 <td>+</td>
    19161547</tr>
    19171548<tr>   <th colspan=9> <a href="#sec:Restoration_Phase">Restoration Phase</a> </th>
     
    19241555<td>+</td>
    19251556<td>+</td>
    1926 <td>+</td>
    1927 <td>+</td>
    1928 <td>+</td>
    19291557</tr>
    19301558<tr>
     
    19351563<td>+</td>
    19361564<td>+</td>
    1937 <td>+</td>
    1938 <td>+</td>
    1939 <td>+</td>
    19401565</tr>
    19411566<tr>
     
    19461571<td>+</td>
    19471572<td>+</td>
    1948 <td>+</td>
    1949 <td>+</td>
    1950 <td>+</td>
    19511573</tr>
    19521574<tr>
     
    19571579<td>+</td>
    19581580<td>+</td>
    1959 <td>+</td>
    1960 <td>+</td>
    1961 <td>+</td>
    19621581</tr>
    19631582<tr>
     
    19681587<td>+</td>
    19691588<td>+</td>
    1970 <td>+</td>
    1971 <td>+</td>
    1972 <td>+</td>
    19731589</tr>
    19741590<tr>
     
    19761592<td>F</td>
    19771593<td> +</td>
    1978 <td>+</td>
    1979 <td>+</td>
    1980 <td>+</td>
    19811594<td>+</td>
    19821595<td>+</td>
     
    19901603<td>+</td>
    19911604<td>+</td>
    1992 <td>+</td>
    1993 <td>+</td>
    1994 <td>+</td>
    19951605</tr>
    19961606<tr>
     
    20011611<td>+</td>
    20021612<td>+</td>
    2003 <td>+</td>
    2004 <td>+</td>
    2005 <td>+</td>
    20061613</tr>
    20071614<tr>
     
    20121619<td>+</td>
    20131620<td>+</td>
     1621</tr>
     1622<tr>
     1623<td> <a href="#sec:resto_failure_feasibility_threshold">resto_failure_feasibility_threshold</a> </td>
     1624<td>F</td>
     1625<td> +</td>
    20141626<td>+</td>
    20151627<td>+</td>
     
    20231635<td>+</td>
    20241636<td>+</td>
     1637</tr>
     1638<tr>
     1639<td> <a href="#sec:resto_proximity_weight">resto_proximity_weight</a> </td>
     1640<td>F</td>
     1641<td> +</td>
    20251642<td>+</td>
    20261643<td>+</td>
     
    20341651<td>+</td>
    20351652<td>+</td>
    2036 <td>+</td>
    2037 <td>+</td>
    2038 <td>+</td>
    20391653</tr>
    20401654<tr>
     
    20451659<td>+</td>
    20461660<td>+</td>
    2047 <td>+</td>
    2048 <td>+</td>
    2049 <td>+</td>
    20501661</tr>
    20511662<tr>   <th colspan=9> <a href="#sec:Step_Calculation">Step Calculation</a> </th>
     
    20581669<td>+</td>
    20591670<td>+</td>
    2060 <td>+</td>
    2061 <td>+</td>
    2062 <td>+</td>
    20631671</tr>
    20641672<tr>
     
    20691677<td>+</td>
    20701678<td>+</td>
    2071 <td>+</td>
    2072 <td>+</td>
    2073 <td>+</td>
    20741679</tr>
    20751680<tr>
     
    20801685<td>+</td>
    20811686<td>+</td>
    2082 <td>+</td>
    2083 <td>+</td>
    2084 <td>+</td>
    20851687</tr>
    20861688<tr>
     
    20911693<td>+</td>
    20921694<td>+</td>
    2093 <td>+</td>
    2094 <td>+</td>
    2095 <td>+</td>
    20961695</tr>
    20971696<tr>
     
    20991698<td>F</td>
    21001699<td> +</td>
    2101 <td>+</td>
    2102 <td>+</td>
    2103 <td>+</td>
    21041700<td>+</td>
    21051701<td>+</td>
     
    21131709<td>+</td>
    21141710<td>+</td>
    2115 <td>+</td>
    2116 <td>+</td>
    2117 <td>+</td>
    21181711</tr>
    21191712<tr>
     
    21241717<td>+</td>
    21251718<td>+</td>
    2126 <td>+</td>
    2127 <td>+</td>
    2128 <td>+</td>
    21291719</tr>
    21301720<tr>
     
    21321722<td>F</td>
    21331723<td> +</td>
    2134 <td>+</td>
    2135 <td>+</td>
    2136 <td>+</td>
    21371724<td>+</td>
    21381725<td>+</td>
     
    21461733<td>+</td>
    21471734<td>+</td>
    2148 <td>+</td>
    2149 <td>+</td>
    2150 <td>+</td>
    21511735</tr>
    21521736<tr>
     
    21571741<td>+</td>
    21581742<td>+</td>
    2159 <td>+</td>
    2160 <td>+</td>
    2161 <td>+</td>
    21621743</tr>
    21631744<tr>
     
    21681749<td>+</td>
    21691750<td>+</td>
    2170 <td>+</td>
    2171 <td>+</td>
    2172 <td>+</td>
    21731751</tr>
    21741752<tr>
     
    21791757<td>+</td>
    21801758<td>+</td>
    2181 <td>+</td>
    2182 <td>+</td>
    2183 <td>+</td>
    21841759</tr>
    21851760<tr>
     
    21901765<td>+</td>
    21911766<td>+</td>
    2192 <td>+</td>
    2193 <td>+</td>
    2194 <td>+</td>
    21951767</tr>
    21961768<tr>
     
    22011773<td>+</td>
    22021774<td>+</td>
    2203 <td>+</td>
    2204 <td>+</td>
    2205 <td>+</td>
    22061775</tr>
    22071776<tr>
     
    22121781<td>+</td>
    22131782<td>+</td>
    2214 <td>+</td>
    2215 <td>+</td>
    2216 <td>+</td>
    22171783</tr>
    22181784<tr>
     
    22231789<td>+</td>
    22241790<td>+</td>
    2225 <td>+</td>
    2226 <td>+</td>
    2227 <td>+</td>
    22281791</tr>
    22291792<tr>
     
    22341797<td>+</td>
    22351798<td>+</td>
    2236 <td>+</td>
    2237 <td>+</td>
    2238 <td>+</td>
    22391799</tr>
    22401800<tr>   <th colspan=9> <a href="#sec:Uncategorized">Uncategorized</a> </th>
     
    22471807<td>+</td>
    22481808<td>+</td>
    2249 <td>+</td>
    2250 <td>+</td>
    2251 <td>+</td>
    22521809</tr>
    22531810<tr>   <th colspan=9> <a href="#sec:Undocumented">Undocumented</a> </th>
     
    22601817<td>+</td>
    22611818<td>+</td>
    2262 <td>+</td>
    2263 <td>+</td>
    2264 <td>+</td>
    22651819</tr>
    22661820<tr>
     
    22711825<td>+</td>
    22721826<td>+</td>
    2273 <td>+</td>
    2274 <td>+</td>
    2275 <td>+</td>
    22761827</tr>
    22771828<tr>
     
    22821833<td>+</td>
    22831834<td>+</td>
    2284 <td>+</td>
    2285 <td>+</td>
    2286 <td>+</td>
    22871835</tr>
    22881836<tr>
     
    22931841<td>+</td>
    22941842<td>+</td>
    2295 <td>+</td>
    2296 <td>+</td>
    2297 <td>+</td>
    22981843</tr>
    22991844<tr>
     
    23041849<td>+</td>
    23051850<td>+</td>
    2306 <td>+</td>
    2307 <td>+</td>
    2308 <td>+</td>
    23091851</tr>
    23101852<tr>
     
    23151857<td>+</td>
    23161858<td>+</td>
    2317 <td>+</td>
    2318 <td>+</td>
    2319 <td>+</td>
    23201859</tr>
    23211860<tr>
     
    23261865<td>+</td>
    23271866<td>+</td>
    2328 <td>+</td>
    2329 <td>+</td>
    2330 <td>+</td>
    23311867</tr>
    23321868<tr>
     
    23371873<td>+</td>
    23381874<td>+</td>
    2339 <td>+</td>
    2340 <td>+</td>
    2341 <td>+</td>
    23421875</tr>
    23431876<tr>
     
    23481881<td>+</td>
    23491882<td>+</td>
    2350 <td>+</td>
    2351 <td>+</td>
    2352 <td>+</td>
    23531883</tr>
    23541884<tr>
     
    23591889<td>+</td>
    23601890<td>+</td>
    2361 <td>+</td>
    2362 <td>+</td>
    2363 <td>+</td>
    23641891</tr>
    23651892<tr>
     
    23701897<td>+</td>
    23711898<td>+</td>
    2372 <td>+</td>
    2373 <td>+</td>
    2374 <td>+</td>
    23751899</tr>
    23761900<tr>
     
    23811905<td>+</td>
    23821906<td>+</td>
    2383 <td>+</td>
    2384 <td>+</td>
    2385 <td>+</td>
    23861907</tr>
    23871908<tr>
     
    23921913<td>+</td>
    23931914<td>+</td>
    2394 <td>+</td>
    2395 <td>+</td>
    2396 <td>+</td>
    2397 </tr>
    2398 <tr>
    2399 <td> <a href="#sec:line_search_method">line_search_method</a> </td>
    2400 <td>S</td>
    2401 <td> +</td>
    2402 <td>+</td>
    2403 <td>+</td>
    2404 <td>+</td>
    2405 <td>+</td>
    2406 <td>+</td>
    2407 <td>+</td>
    24081915</tr>
    24091916<tr>
     
    24141921<td>+</td>
    24151922<td>+</td>
    2416 <td>+</td>
    2417 <td>+</td>
    2418 <td>+</td>
    24191923</tr>
    24201924<tr>
     
    24251929<td>+</td>
    24261930<td>+</td>
    2427 <td>+</td>
    2428 <td>+</td>
    2429 <td>+</td>
    24301931</tr>
    24311932<tr>
     
    24361937<td>+</td>
    24371938<td>+</td>
    2438 <td>+</td>
    2439 <td>+</td>
    2440 <td>+</td>
    24411939</tr>
    24421940<tr>
     
    24471945<td>+</td>
    24481946<td>+</td>
    2449 <td>+</td>
    2450 <td>+</td>
    2451 <td>+</td>
    24521947</tr>
    24531948<tr>
     
    24581953<td>+</td>
    24591954<td>+</td>
    2460 <td>+</td>
    2461 <td>+</td>
    2462 <td>+</td>
    24631955</tr>
    24641956<tr>
     
    24691961<td>+</td>
    24701962<td>+</td>
    2471 <td>+</td>
    2472 <td>+</td>
    2473 <td>+</td>
    24741963</tr>
    24751964<tr>
     
    24801969<td>+</td>
    24811970<td>+</td>
    2482 <td>+</td>
    2483 <td>+</td>
    2484 <td>+</td>
    24851971</tr>
    24861972<tr>
     
    24911977<td>+</td>
    24921978<td>+</td>
    2493 <td>+</td>
    2494 <td>+</td>
    2495 <td>+</td>
    24961979</tr>
    24971980<tr>
     
    25021985<td>+</td>
    25031986<td>+</td>
    2504 <td>+</td>
    2505 <td>+</td>
    2506 <td>+</td>
    25071987</tr>
    25081988<tr>
     
    25131993<td>+</td>
    25141994<td>+</td>
    2515 <td>+</td>
    2516 <td>+</td>
    2517 <td>+</td>
    25181995</tr>
    25191996<tr>
     
    25242001<td>+</td>
    25252002<td>+</td>
    2526 <td>+</td>
    2527 <td>+</td>
    2528 <td>+</td>
    25292003</tr>
    25302004<tr>
     
    25352009<td>+</td>
    25362010<td>+</td>
    2537 <td>+</td>
    2538 <td>+</td>
    2539 <td>+</td>
    25402011</tr>
    25412012<tr>
     
    25462017<td>+</td>
    25472018<td>+</td>
    2548 <td>+</td>
    2549 <td>+</td>
    2550 <td>+</td>
    25512019</tr>
    25522020<tr>
     
    25572025<td>+</td>
    25582026<td>+</td>
    2559 <td>+</td>
    2560 <td>+</td>
    2561 <td>+</td>
    25622027</tr>
    25632028<tr>
     
    25682033<td>+</td>
    25692034<td>+</td>
    2570 <td>+</td>
    2571 <td>+</td>
    2572 <td>+</td>
    25732035</tr>
    25742036<tr>
     
    25792041<td>+</td>
    25802042<td>+</td>
    2581 <td>+</td>
    2582 <td>+</td>
    2583 <td>+</td>
    25842043</tr>
    25852044<tr>
     
    25902049<td>+</td>
    25912050<td>+</td>
    2592 <td>+</td>
    2593 <td>+</td>
    2594 <td>+</td>
    25952051</tr>
    25962052<tr>
     
    26012057<td>+</td>
    26022058<td>+</td>
    2603 <td>+</td>
    2604 <td>+</td>
    2605 <td>+</td>
    26062059</tr>
    26072060<tr>
     
    26122065<td>+</td>
    26132066<td>+</td>
    2614 <td>+</td>
    2615 <td>+</td>
    2616 <td>+</td>
    26172067</tr>
    26182068<tr>
     
    26232073<td>+</td>
    26242074<td>+</td>
    2625 <td>+</td>
    2626 <td>+</td>
    2627 <td>+</td>
    26282075</tr>
    26292076<tr>
     
    26342081<td>+</td>
    26352082<td>+</td>
    2636 <td>+</td>
    2637 <td>+</td>
    2638 <td>+</td>
    26392083</tr>
    26402084<tr>   <th colspan=9> <a href="#sec:Warm_Start">Warm Start</a> </th>
     
    26472091<td>+</td>
    26482092<td>+</td>
    2649 <td>+</td>
    2650 <td>+</td>
    2651 <td>+</td>
    26522093</tr>
    26532094<tr>
     
    26582099<td>+</td>
    26592100<td>+</td>
    2660 <td>+</td>
    2661 <td>+</td>
    2662 <td>+</td>
    26632101</tr>
    26642102<tr>
     
    26692107<td>+</td>
    26702108<td>+</td>
    2671 <td>+</td>
    2672 <td>+</td>
    2673 <td>+</td>
    26742109</tr>
    26752110<tr>
     
    26802115<td>+</td>
    26812116<td>+</td>
    2682 <td>+</td>
    2683 <td>+</td>
    2684 <td>+</td>
    26852117</tr>
    26862118<tr>
     
    26912123<td>+</td>
    26922124<td>+</td>
    2693 <td>+</td>
    2694 <td>+</td>
    2695 <td>+</td>
    26962125</tr>
    26972126<tr>
     
    27022131<td>+</td>
    27032132<td>+</td>
    2704 <td>+</td>
    2705 <td>+</td>
    2706 <td>+</td>
    27072133</tr>
    27082134<tr>
     
    27132139<td>+</td>
    27142140<td>+</td>
    2715 <td>+</td>
    2716 <td>+</td>
    2717 <td>+</td>
    27182141</tr>
    27192142<tr>
     
    27242147<td>+</td>
    27252148<td>+</td>
    2726 <td>+</td>
    2727 <td>+</td>
    2728 <td>+</td>
    27292149</tr>
    27302150<tr>
     
    27322152<td>F</td>
    27332153<td> +</td>
    2734 <td>+</td>
    2735 <td>+</td>
    2736 <td>+</td>
    27372154<td>+</td>
    27382155<td>+</td>
     
    27432160}
    27442161}
    2745 \htmlanchor{sec:sb}
    27462162\paragraph{sb:}\label{sec:sb}  $\;$ \\
    27472163
     
    27542170\end{itemize}
    27552171
    2756 \subsectionH{Barrier Parameter Update}{sec:Barrier_Parameter_Update}
    2757 \htmlanchor{sec:adaptive\_mu\_globalization}
     2172\subsection{Barrier Parameter Update}
     2173\label{sec:Barrier_Parameter_Update}
     2174\htmlanchor{sec:Barrier_Parameter_Update}
    27582175\paragraph{adaptive\_mu\_globalization:}\label{sec:adaptive_mu_globalization} Globalization strategy for the adaptive mu selection mode. $\;$ \\
    27592176 To achieve global convergence of the adaptive
     
    27742191\end{itemize}
    27752192
    2776 \htmlanchor{sec:adaptive\_mu\_kkt\_norm\_type}
    27772193\paragraph{adaptive\_mu\_kkt\_norm\_type:}\label{sec:adaptive_mu_kkt_norm_type} Norm used for the KKT error in the adaptive mu globalization strategies. $\;$ \\
    27782194 When computing the KKT error for the
     
    27902206\end{itemize}
    27912207
    2792 \htmlanchor{sec:adaptive\_mu\_kkterror\_red\_fact}
    27932208\paragraph{adaptive\_mu\_kkterror\_red\_fact:}\label{sec:adaptive_mu_kkterror_red_fact} Sufficient decrease factor for "kkt-error" globalization strategy. $\;$ \\
    27942209 For the "kkt-error" based globalization strategy,
     
    27992214
    28002215
    2801 \htmlanchor{sec:adaptive\_mu\_kkterror\_red\_iters}
    28022216\paragraph{adaptive\_mu\_kkterror\_red\_iters:}\label{sec:adaptive_mu_kkterror_red_iters} Maximum number of iterations requiring sufficient progress. $\;$ \\
    28032217 For the "kkt-error" based globalization strategy,
     
    28112225
    28122226
    2813 \htmlanchor{sec:adaptive\_mu\_monotone\_init\_factor}
    28142227\paragraph{adaptive\_mu\_monotone\_init\_factor:}\label{sec:adaptive_mu_monotone_init_factor} Determines the initial value of the barrier parameter when switching to the monotone mode. $\;$ \\
    28152228 When the globalization strategy for the adaptive
     
    28232236
    28242237
    2825 \htmlanchor{sec:adaptive\_mu\_restore\_previous\_iterate}
    28262238\paragraph{adaptive\_mu\_restore\_previous\_iterate:}\label{sec:adaptive_mu_restore_previous_iterate} Indicates if the previous iterate should be restored if the monotone mode is entered. $\;$ \\
    28272239 When the globalization strategy for the adaptive
     
    28382250\end{itemize}
    28392251
    2840 \htmlanchor{sec:barrier\_tol\_factor}
    28412252\paragraph{barrier\_tol\_factor:}\label{sec:barrier_tol_factor} Factor for mu in barrier stop test. $\;$ \\
    28422253 The convergence tolerance for each barrier
     
    28502261
    28512262
    2852 \htmlanchor{sec:filter\_margin\_fact}
    28532263\paragraph{filter\_margin\_fact:}\label{sec:filter_margin_fact} Factor determining width of margin for obj-constr-filter adaptive globalization strategy. $\;$ \\
    28542264 When using the adaptive globalization strategy,
     
    28652275
    28662276
    2867 \htmlanchor{sec:filter\_max\_margin}
    28682277\paragraph{filter\_max\_margin:}\label{sec:filter_max_margin} Maximum width of margin in obj-constr-filter adaptive globalization strategy. $\;$ \\
    28692278 The valid range for this real option is
     
    28722281
    28732282
    2874 \htmlanchor{sec:fixed\_mu\_oracle}
    28752283\paragraph{fixed\_mu\_oracle:}\label{sec:fixed_mu_oracle} Oracle for the barrier parameter when switching to fixed mode. $\;$ \\
    28762284 Determines how the first value of the barrier
     
    28892297\end{itemize}
    28902298
    2891 \htmlanchor{sec:mu\_allow\_fast\_monotone\_decrease}
    28922299\paragraph{mu\_allow\_fast\_monotone\_decrease:}\label{sec:mu_allow_fast_monotone_decrease} Allow skipping of barrier problem if barrier test is already met. $\;$ \\
    28932300 If set to "no", the algorithm enforces at least
     
    29032310\end{itemize}
    29042311
    2905 \htmlanchor{sec:mu\_init}
    29062312\paragraph{mu\_init:}\label{sec:mu_init} Initial value for the barrier parameter. $\;$ \\
    29072313 This option determines the initial value for the
     
    29142320
    29152321
    2916 \htmlanchor{sec:mu\_linear\_decrease\_factor}
    29172322\paragraph{mu\_linear\_decrease\_factor:}\label{sec:mu_linear_decrease_factor} Determines linear decrease rate of barrier parameter. $\;$ \\
    29182323 For the Fiacco-McCormick update procedure the new
     
    29272332
    29282333
    2929 \htmlanchor{sec:mu\_max}
    29302334\paragraph{mu\_max:}\label{sec:mu_max} Maximum value for barrier parameter. $\;$ \\
    29312335 This option specifies an upper bound on the
     
    29382342
    29392343
    2940 \htmlanchor{sec:mu\_max\_fact}
    29412344\paragraph{mu\_max\_fact:}\label{sec:mu_max_fact} Factor for initialization of maximum value for barrier parameter. $\;$ \\
    29422345 This option determines the upper bound on the
     
    29492352
    29502353
    2951 \htmlanchor{sec:mu\_min}
    29522354\paragraph{mu\_min:}\label{sec:mu_min} Minimum value for barrier parameter. $\;$ \\
    29532355 This option specifies the lower bound on the
     
    29632365
    29642366
    2965 \htmlanchor{sec:mu\_oracle}
    29662367\paragraph{mu\_oracle:}\label{sec:mu_oracle} Oracle for a new barrier parameter in the adaptive strategy. $\;$ \\
    29672368 Determines how a new barrier parameter is
     
    29792380\end{itemize}
    29802381
    2981 \htmlanchor{sec:mu\_strategy}
    29822382\paragraph{mu\_strategy:}\label{sec:mu_strategy} Update strategy for barrier parameter. $\;$ \\
    29832383 Determines which barrier parameter update
     
    29912391\end{itemize}
    29922392
    2993 \htmlanchor{sec:mu\_superlinear\_decrease\_power}
    29942393\paragraph{mu\_superlinear\_decrease\_power:}\label{sec:mu_superlinear_decrease_power} Determines superlinear decrease rate of barrier parameter. $\;$ \\
    29952394 For the Fiacco-McCormick update procedure the new
     
    30042403
    30052404
    3006 \htmlanchor{sec:quality\_function\_balancing\_term}
    30072405\paragraph{quality\_function\_balancing\_term:}\label{sec:quality_function_balancing_term} The balancing term included in the quality function for centrality. $\;$ \\
    30082406 This determines whether a term is added to the
     
    30192417\end{itemize}
    30202418
    3021 \htmlanchor{sec:quality\_function\_centrality}
    30222419\paragraph{quality\_function\_centrality:}\label{sec:quality_function_centrality} The penalty term for centrality that is included in quality function. $\;$ \\
    30232420 This determines whether a term is added to the
     
    30402437\end{itemize}
    30412438
    3042 \htmlanchor{sec:quality\_function\_max\_section\_steps}
    30432439\paragraph{quality\_function\_max\_section\_steps:}\label{sec:quality_function_max_section_steps} Maximum number of search steps during direct search procedure determining the optimal centering parameter. $\;$ \\
    30442440 The golden section search is performed for the
     
    30492445
    30502446
    3051 \htmlanchor{sec:quality\_function\_norm\_type}
    30522447\paragraph{quality\_function\_norm\_type:}\label{sec:quality_function_norm_type} Norm used for components of the quality function. $\;$ \\
    30532448 (Only used if option "mu\_oracle" is set to
     
    30632458\end{itemize}
    30642459
    3065 \htmlanchor{sec:quality\_function\_section\_qf\_tol}
    30662460\paragraph{quality\_function\_section\_qf\_tol:}\label{sec:quality_function_section_qf_tol} Tolerance for the golden section search procedure determining the optimal centering parameter (in the function value space). $\;$ \\
    30672461 The golden section search is performed for the
     
    30722466
    30732467
    3074 \htmlanchor{sec:quality\_function\_section\_sigma\_tol}
    30752468\paragraph{quality\_function\_section\_sigma\_tol:}\label{sec:quality_function_section_sigma_tol} Tolerance for the section search procedure determining the optimal centering parameter (in sigma space). $\;$ \\
    30762469 The golden section search is performed for the
     
    30812474
    30822475
    3083 \htmlanchor{sec:sigma\_max}
    30842476\paragraph{sigma\_max:}\label{sec:sigma_max} Maximum value of the centering parameter. $\;$ \\
    30852477 This is the upper bound for the centering
     
    30912483
    30922484
    3093 \htmlanchor{sec:sigma\_min}
    30942485\paragraph{sigma\_min:}\label{sec:sigma_min} Minimum value of the centering parameter. $\;$ \\
    30952486 This is the lower bound for the centering
     
    31012492
    31022493
    3103 \htmlanchor{sec:tau\_min}
    31042494\paragraph{tau\_min:}\label{sec:tau_min} Lower bound on fraction-to-the-boundary parameter tau. $\;$ \\
    31052495 (This is tau\_min in the implementation paper.)
     
    31102500
    31112501
    3112 \subsectionH{Convergence}{sec:Convergence}
    3113 \htmlanchor{sec:acceptable\_compl\_inf\_tol}
     2502\subsection{Convergence}
     2503\label{sec:Convergence}
     2504\htmlanchor{sec:Convergence}
    31142505\paragraph{acceptable\_compl\_inf\_tol:}\label{sec:acceptable_compl_inf_tol} "Acceptance" threshold for the complementarity conditions. $\;$ \\
    31152506 Absolute tolerance on the complementarity.
     
    31222513
    31232514
    3124 \htmlanchor{sec:acceptable\_constr\_viol\_tol}
    31252515\paragraph{acceptable\_constr\_viol\_tol:}\label{sec:acceptable_constr_viol_tol} "Acceptance" threshold for the constraint violation. $\;$ \\
    31262516 Absolute tolerance on the constraint violation.
     
    31332523
    31342524
    3135 \htmlanchor{sec:acceptable\_dual\_inf\_tol}
    31362525\paragraph{acceptable\_dual\_inf\_tol:}\label{sec:acceptable_dual_inf_tol} "Acceptance" threshold for the dual infeasibility. $\;$ \\
    31372526 Absolute tolerance on the dual infeasibility.
     
    31442533
    31452534
    3146 \htmlanchor{sec:acceptable\_iter}
    31472535\paragraph{acceptable\_iter:}\label{sec:acceptable_iter} Number of "acceptable" iterates before triggering termination. $\;$ \\
    31482536 If the algorithm encounters this many successive
     
    31552543
    31562544
    3157 \htmlanchor{sec:acceptable\_obj\_change\_tol}
    31582545\paragraph{acceptable\_obj\_change\_tol:}\label{sec:acceptable_obj_change_tol} "Acceptance" stopping criterion based on objective function change. $\;$ \\
    31592546 If the relative change of the objective function
     
    31682555
    31692556
    3170 \htmlanchor{sec:acceptable\_tol}
    31712557\paragraph{acceptable\_tol:}\label{sec:acceptable_tol} "Acceptable" convergence tolerance (relative). $\;$ \\
    31722558 Determines which (scaled) overall optimality
     
    31872573
    31882574
    3189 \htmlanchor{sec:compl\_inf\_tol}
    31902575\paragraph{compl\_inf\_tol:}\label{sec:compl_inf_tol} Desired threshold for the complementarity conditions. $\;$ \\
    31912576 Absolute tolerance on the complementarity.
     
    31972582
    31982583
    3199 \htmlanchor{sec:constr\_viol\_tol}
    32002584\paragraph{constr\_viol\_tol:}\label{sec:constr_viol_tol} Desired threshold for the constraint violation. $\;$ \\
    32012585 Absolute tolerance on the constraint violation.
     
    32072591
    32082592
    3209 \htmlanchor{sec:diverging\_iterates\_tol}
    32102593\paragraph{diverging\_iterates\_tol:}\label{sec:diverging_iterates_tol} Threshold for maximal value of primal iterates. $\;$ \\
    32112594 If any component of the primal iterates exceeded
     
    32172600
    32182601
    3219 \htmlanchor{sec:dual\_inf\_tol}
    32202602\paragraph{dual\_inf\_tol:}\label{sec:dual_inf_tol} Desired threshold for the dual infeasibility. $\;$ \\
    32212603 Absolute tolerance on the dual infeasibility.
     
    32272609
    32282610
    3229 \htmlanchor{sec:max\_cpu\_time}
    32302611\paragraph{max\_cpu\_time:}\label{sec:max_cpu_time} Maximum number of CPU seconds. $\;$ \\
    32312612 A limit on CPU seconds that Ipopt can use to
     
    32372618
    32382619
    3239 \htmlanchor{sec:max\_iter}
    32402620\paragraph{max\_iter:}\label{sec:max_iter} Maximum number of iterations. $\;$ \\
    32412621 The algorithm terminates with an error message if
     
    32452625
    32462626
    3247 \htmlanchor{sec:s\_max}
     2627\paragraph{mu\_target:}\label{sec:mu_target} Desired value of complementarity. $\;$ \\
     2628 Usually, the barrier parameter is driven to zero
     2629and the termination test for complementarity is
     2630measured with respect to zero complementarity.
     2631However, in some cases it might be desired to
     2632have Ipopt solve barrier problem for strictly
     2633positive value of the barrier parameter.  In this
     2634case, the value of "mu\_target" specifies the
     2635final value of the barrier parameter, and the
     2636termination tests are then defined with respect
     2637to the barrier problem for this value of the
     2638barrier parameter. The valid range for this real option is
     2639$0 \le {\tt mu\_target } <  {\tt +inf}$
     2640and its default value is $0$.
     2641
     2642
    32482643\paragraph{s\_max:}\label{sec:s_max} Scaling threshold for the NLP error. $\;$ \\
    32492644 (See paragraph after Eqn. (6) in the
     
    32532648
    32542649
    3255 \htmlanchor{sec:tol}
    32562650\paragraph{tol:}\label{sec:tol} Desired convergence tolerance (relative). $\;$ \\
    32572651 Determines the convergence tolerance for the
     
    32602654smaller than this value, and if the (absolute)
    32612655criteria according to "dual\_inf\_tol",
    3262 "primal\_inf\_tol", and "cmpl\_inf\_tol" are met.
    3263  (This is epsilon\_tol in Eqn. (6) in
     2656"primal\_inf\_tol", and "compl\_inf\_tol" are
     2657met. (This is epsilon\_tol in Eqn. (6) in
    32642658implementation paper).  See also
    32652659"acceptable\_tol" as a second termination
     
    32712665
    32722666
    3273 \subsectionH{Derivative Checker}{sec:Derivative_Checker}
    3274 \htmlanchor{sec:derivative\_test}
     2667\subsection{Derivative Checker}
     2668\label{sec:Derivative_Checker}
     2669\htmlanchor{sec:Derivative_Checker}
    32752670\paragraph{derivative\_test:}\label{sec:derivative_test} Enable derivative checker $\;$ \\
    32762671 If this option is enabled, a (slow!) derivative
     
    32922687\end{itemize}
    32932688
    3294 \htmlanchor{sec:derivative\_test\_first\_index}
    32952689\paragraph{derivative\_test\_first\_index:}\label{sec:derivative_test_first_index} Index of first quantity to be checked by derivative checker $\;$ \\
    32962690 If this is set to -2, then all derivatives are
     
    33062700
    33072701
    3308 \htmlanchor{sec:derivative\_test\_perturbation}
    33092702\paragraph{derivative\_test\_perturbation:}\label{sec:derivative_test_perturbation} Size of the finite difference perturbation in derivative test. $\;$ \\
    33102703 This determines the relative perturbation of the
     
    33142707
    33152708
    3316 \htmlanchor{sec:derivative\_test\_print\_all}
    33172709\paragraph{derivative\_test\_print\_all:}\label{sec:derivative_test_print_all} Indicates whether information for all estimated derivatives should be printed. $\;$ \\
    33182710 Determines verbosity of derivative checker.
     
    33252717\end{itemize}
    33262718
    3327 \htmlanchor{sec:derivative\_test\_tol}
    33282719\paragraph{derivative\_test\_tol:}\label{sec:derivative_test_tol} Threshold for indicating wrong derivative. $\;$ \\
    33292720 If the relative deviation of the estimated
     
    33352726
    33362727
    3337 \htmlanchor{sec:findiff\_perturbation}
    33382728\paragraph{findiff\_perturbation:}\label{sec:findiff_perturbation} Size of the finite difference perturbation for derivative approximation. $\;$ \\
    33392729 This determines the relative perturbation of the
     
    33432733
    33442734
    3345 \htmlanchor{sec:jacobian\_approximation}
    33462735\paragraph{jacobian\_approximation:}\label{sec:jacobian_approximation} Specifies technique to compute constraint Jacobian $\;$ \\
    33472736
     
    33552744\end{itemize}
    33562745
    3357 \htmlanchor{sec:point\_perturbation\_radius}
    33582746\paragraph{point\_perturbation\_radius:}\label{sec:point_perturbation_radius} Maximal perturbation of an evaluation point. $\;$ \\
    33592747 If a random perturbation of a points is required,
     
    33662754
    33672755
    3368 \subsectionH{Hessian Approximation}{sec:Hessian_Approximation}
    3369 \htmlanchor{sec:hessian\_approximation}
     2756\subsection{Hessian Approximation}
     2757\label{sec:Hessian_Approximation}
     2758\htmlanchor{sec:Hessian_Approximation}
    33702759\paragraph{hessian\_approximation:}\label{sec:hessian_approximation} Indicates what Hessian information is to be used. $\;$ \\
    33712760 This determines which kind of information for the
     
    33812770\end{itemize}
    33822771
    3383 \htmlanchor{sec:hessian\_approximation\_space}
    33842772\paragraph{hessian\_approximation\_space:}\label{sec:hessian_approximation_space} Indicates in which subspace the Hessian information is to be approximated. $\;$ \\
    33852773
     
    33922780\end{itemize}
    33932781
    3394 \htmlanchor{sec:limited\_memory\_init\_val}
     2782\paragraph{limited\_memory\_aug\_solver:}\label{sec:limited_memory_aug_solver} Strategy for solving the augmented system for low-rank Hessian. $\;$ \\
     2783
     2784The default value for this string option is "sherman-morrison".
     2785\\
     2786Possible values:
     2787\begin{itemize}
     2788   \item sherman-morrison: use Sherman-Morrison formula
     2789   \item extended: use an extended augmented system
     2790\end{itemize}
     2791
    33952792\paragraph{limited\_memory\_init\_val:}\label{sec:limited_memory_init_val} Value for B0 in low-rank update. $\;$ \\
    33962793 The starting matrix in the low rank update, B0,
     
    34042801
    34052802
    3406 \htmlanchor{sec:limited\_memory\_init\_val\_max}
    34072803\paragraph{limited\_memory\_init\_val\_max:}\label{sec:limited_memory_init_val_max} Upper bound on value for B0 in low-rank update. $\;$ \\
    34082804 The starting matrix in the low rank update, B0,
     
    34162812
    34172813
    3418 \htmlanchor{sec:limited\_memory\_init\_val\_min}
    34192814\paragraph{limited\_memory\_init\_val\_min:}\label{sec:limited_memory_init_val_min} Lower bound on value for B0 in low-rank update. $\;$ \\
    34202815 The starting matrix in the low rank update, B0,
     
    34282823
    34292824
    3430 \htmlanchor{sec:limited\_memory\_initialization}
    34312825\paragraph{limited\_memory\_initialization:}\label{sec:limited_memory_initialization} Initialization strategy for the limited memory quasi-Newton approximation. $\;$ \\
    34322826 Determines how the diagonal Matrix B\_0 as the
     
    34392833   \item scalar1: sigma = s\^Ty/s\^Ts
    34402834   \item scalar2: sigma = y\^Ty/s\^Ty
     2835   \item scalar3: arithmetic average of scalar1 and scalar2
     2836   \item scalar4: geometric average of scalar1 and scalar2
    34412837   \item constant: sigma = limited\_memory\_init\_val
    34422838\end{itemize}
    34432839
    3444 \htmlanchor{sec:limited\_memory\_max\_history}
    34452840\paragraph{limited\_memory\_max\_history:}\label{sec:limited_memory_max_history} Maximum size of the history for the limited quasi-Newton Hessian approximation. $\;$ \\
    34462841 This option determines the number of most recent
     
    34512846
    34522847
    3453 \htmlanchor{sec:limited\_memory\_max\_skipping}
    34542848\paragraph{limited\_memory\_max\_skipping:}\label{sec:limited_memory_max_skipping} Threshold for successive iterations where update is skipped. $\;$ \\
    34552849 If the update is skipped more than this number of
     
    34602854
    34612855
    3462 \htmlanchor{sec:limited\_memory\_update\_type}
     2856\paragraph{limited\_memory\_special\_for\_resto:}\label{sec:limited_memory_special_for_resto} Determines if the quasi-Newton updates should be special during the restoration phase. $\;$ \\
     2857 Until Nov 2010, Ipopt used a special update
     2858during the restoration phase, but it turned out
     2859that this does not work well.  The new default
     2860uses the regular update procedure and it improves
     2861results.  If for some reason you want to get back
     2862to the original update, set this option to "yes".
     2863The default value for this string option is "no".
     2864\\
     2865Possible values:
     2866\begin{itemize}
     2867   \item no: use the same update as in regular iterations
     2868   \item yes: use the a special update during restoration
     2869phase
     2870\end{itemize}
     2871
    34632872\paragraph{limited\_memory\_update\_type:}\label{sec:limited_memory_update_type} Quasi-Newton update formula for the limited memory approximation. $\;$ \\
    34642873 Determines which update formula is to be used for
     
    34722881\end{itemize}
    34732882
    3474 \subsectionH{Initialization}{sec:Initialization}
    3475 \htmlanchor{sec:bound\_frac}
     2883\subsection{Initialization}
     2884\label{sec:Initialization}
     2885\htmlanchor{sec:Initialization}
    34762886\paragraph{bound\_frac:}\label{sec:bound_frac} Desired minimum relative distance from the initial point to bound. $\;$ \\
    34772887 Determines how much the initial point might have
     
    34842894
    34852895
    3486 \htmlanchor{sec:bound\_mult\_init\_method}
    34872896\paragraph{bound\_mult\_init\_method:}\label{sec:bound_mult_init_method} Initialization method for bound multipliers $\;$ \\
    34882897 This option defines how the iterates for the
     
    35052914\end{itemize}
    35062915
    3507 \htmlanchor{sec:bound\_mult\_init\_val}
    35082916\paragraph{bound\_mult\_init\_val:}\label{sec:bound_mult_init_val} Initial value for the bound multipliers. $\;$ \\
    35092917 All dual variables corresponding to bound
     
    35132921
    35142922
    3515 \htmlanchor{sec:bound\_push}
    35162923\paragraph{bound\_push:}\label{sec:bound_push} Desired minimum absolute distance from the initial point to bound. $\;$ \\
    35172924 Determines how much the initial point might have
     
    35242931
    35252932
    3526 \htmlanchor{sec:constr\_mult\_init\_max}
    35272933\paragraph{constr\_mult\_init\_max:}\label{sec:constr_mult_init_max} Maximum allowed least-square guess of constraint multipliers. $\;$ \\
    35282934 Determines how large the initial least-square
     
    35392945
    35402946
    3541 \htmlanchor{sec:least\_square\_init\_duals}
    35422947\paragraph{least\_square\_init\_duals:}\label{sec:least_square_init_duals} Least square initialization of all dual variables $\;$ \\
    35432948 If set to yes, Ipopt tries to compute
     
    35592964\end{itemize}
    35602965
    3561 \htmlanchor{sec:least\_square\_init\_primal}
    35622966\paragraph{least\_square\_init\_primal:}\label{sec:least_square_init_primal} Least square initialization of the primal variables $\;$ \\
    35632967 If set to yes, Ipopt ignores the user provided
     
    35762980\end{itemize}
    35772981
    3578 \htmlanchor{sec:slack\_bound\_frac}
    35792982\paragraph{slack\_bound\_frac:}\label{sec:slack_bound_frac} Desired minimum relative distance from the initial slack to bound. $\;$ \\
    35802983 Determines how much the initial slack variables
     
    35872990
    35882991
    3589 \htmlanchor{sec:slack\_bound\_push}
    35902992\paragraph{slack\_bound\_push:}\label{sec:slack_bound_push} Desired minimum absolute distance from the initial slack to bound. $\;$ \\
    35912993 Determines how much the initial slack variables
     
    35983000
    35993001
    3600 \subsectionH{Line Search}{sec:Line_Search}
    3601 \htmlanchor{sec:accept\_after\_max\_steps}
     3002\subsection{Line Search}
     3003\label{sec:Line_Search}
     3004\htmlanchor{sec:Line_Search}
    36023005\paragraph{accept\_after\_max\_steps:}\label{sec:accept_after_max_steps} Accept a trial point after maximal this number of steps. $\;$ \\
    36033006 Even if it does not satisfy line search
     
    36073010
    36083011
    3609 \htmlanchor{sec:accept\_every\_trial\_step}
    36103012\paragraph{accept\_every\_trial\_step:}\label{sec:accept_every_trial_step} Always accept the first trial step. $\;$ \\
    36113013 Setting this option to "yes" essentially disables
     
    36213023\end{itemize}
    36223024
    3623 \htmlanchor{sec:alpha\_for\_y}
    36243025\paragraph{alpha\_for\_y:}\label{sec:alpha_for_y} Method to determine the step size for constraint multipliers. $\;$ \\
    36253026 This option determines how the step size
     
    36473048\end{itemize}
    36483049
    3649 \htmlanchor{sec:alpha\_for\_y\_tol}
    36503050\paragraph{alpha\_for\_y\_tol:}\label{sec:alpha_for_y_tol} Tolerance for switching to full equality multiplier steps. $\;$ \\
    36513051 This is only relevant if "alpha\_for\_y" is
     
    36583058
    36593059
    3660 \htmlanchor{sec:alpha\_min\_frac}
    36613060\paragraph{alpha\_min\_frac:}\label{sec:alpha_min_frac} Safety factor for the minimal step size (before switching to restoration phase). $\;$ \\
    36623061 (This is gamma\_alpha in Eqn. (20) in the
     
    36663065
    36673066
    3668 \htmlanchor{sec:alpha\_red\_factor}
    36693067\paragraph{alpha\_red\_factor:}\label{sec:alpha_red_factor} Fractional reduction of the trial step size in the backtracking line search. $\;$ \\
    36703068 At every step of the backtracking line search,
     
    36743072
    36753073
    3676 \htmlanchor{sec:corrector\_compl\_avrg\_red\_fact}
     3074\paragraph{constraint\_violation\_norm\_type:}\label{sec:constraint_violation_norm_type} Norm to be used for the constraint violation in the line search. $\;$ \\
     3075 Determines which norm should be used when the
     3076algorithm computes the constraint violation in
     3077the line search.
     3078The default value for this string option is "1-norm".
     3079\\
     3080Possible values:
     3081\begin{itemize}
     3082   \item 1-norm: use the 1-norm
     3083   \item 2-norm: use the 2-norm
     3084   \item max-norm: use the infinity norm
     3085\end{itemize}
     3086
    36773087\paragraph{corrector\_compl\_avrg\_red\_fact:}\label{sec:corrector_compl_avrg_red_fact} Complementarity tolerance factor for accepting corrector step (unsupported!). $\;$ \\
    36783088 This option determines the factor by which
     
    36833093
    36843094
    3685 \htmlanchor{sec:corrector\_type}
    36863095\paragraph{corrector\_type:}\label{sec:corrector_type} The type of corrector steps that should be taken (unsupported!). $\;$ \\
    36873096 If "mu\_strategy" is "adaptive", this option
     
    36973106\end{itemize}
    36983107
    3699 \htmlanchor{sec:delta}
    37003108\paragraph{delta:}\label{sec:delta} Multiplier for constraint violation in the switching rule. $\;$ \\
    37013109 (See Eqn. (19) in the implementation paper.) The valid range for this real option is
     
    37043112
    37053113
    3706 \htmlanchor{sec:eta\_phi}
    37073114\paragraph{eta\_phi:}\label{sec:eta_phi} Relaxation factor in the Armijo condition. $\;$ \\
    37083115 (See Eqn. (20) in the implementation paper) The valid range for this real option is
     
    37113118
    37123119
    3713 \htmlanchor{sec:filter\_reset\_trigger}
    37143120\paragraph{filter\_reset\_trigger:}\label{sec:filter_reset_trigger} Number of iterations that trigger the filter reset. $\;$ \\
    37153121 If the filter reset heuristic is active and the
     
    37213127
    37223128
    3723 \htmlanchor{sec:gamma\_phi}
    37243129\paragraph{gamma\_phi:}\label{sec:gamma_phi} Relaxation factor in the filter margin for the barrier function. $\;$ \\
    37253130 (See Eqn. (18a) in the implementation paper.) The valid range for this real option is
     
    37283133
    37293134
    3730 \htmlanchor{sec:gamma\_theta}
    37313135\paragraph{gamma\_theta:}\label{sec:gamma_theta} Relaxation factor in the filter margin for the constraint violation. $\;$ \\
    37323136 (See Eqn. (18b) in the implementation paper.) The valid range for this real option is
     
    37353139
    37363140
    3737 \htmlanchor{sec:kappa\_sigma}
    37383141\paragraph{kappa\_sigma:}\label{sec:kappa_sigma} Factor limiting the deviation of dual variables from primal estimates. $\;$ \\
    37393142 If the dual variables deviate from their primal
     
    37453148
    37463149
    3747 \htmlanchor{sec:kappa\_soc}
    37483150\paragraph{kappa\_soc:}\label{sec:kappa_soc} Factor in the sufficient reduction rule for second order correction. $\;$ \\
    37493151 This option determines how much a second order
     
    37563158
    37573159
    3758 \htmlanchor{sec:max\_filter\_resets}
     3160\paragraph{line\_search\_method:}\label{sec:line_search_method} Globalization method used in backtracking line search $\;$ \\
     3161 Only the "filter" choice is officially supported.
     3162 But sometimes, good results might be obtained
     3163with the other choices.
     3164The default value for this string option is "filter".
     3165\\
     3166Possible values:
     3167\begin{itemize}
     3168   \item filter: Filter method
     3169   \item cg-penalty: Chen-Goldfarb penalty function
     3170   \item penalty: Standard penalty function
     3171\end{itemize}
     3172
    37593173\paragraph{max\_filter\_resets:}\label{sec:max_filter_resets} Maximal allowed number of filter resets $\;$ \\
    37603174 A positive number enables a heuristic that resets
     
    37693183
    37703184
    3771 \htmlanchor{sec:max\_soc}
    37723185\paragraph{max\_soc:}\label{sec:max_soc} Maximum number of second order correction trial steps at each iteration. $\;$ \\
    37733186 Choosing 0 disables the second order corrections.
     
    37783191
    37793192
    3780 \htmlanchor{sec:nu\_inc}
    37813193\paragraph{nu\_inc:}\label{sec:nu_inc} Increment of the penalty parameter. $\;$ \\
    37823194 The valid range for this real option is
     
    37853197
    37863198
    3787 \htmlanchor{sec:nu\_init}
    37883199\paragraph{nu\_init:}\label{sec:nu_init} Initial value of the penalty parameter. $\;$ \\
    37893200 The valid range for this real option is
     
    37923203
    37933204
    3794 \htmlanchor{sec:obj\_max\_inc}
    37953205\paragraph{obj\_max\_inc:}\label{sec:obj_max_inc} Determines the upper bound on the acceptable increase of barrier objective function. $\;$ \\
    37963206 Trial points are rejected if they lead to an
     
    38013211
    38023212
    3803 \htmlanchor{sec:recalc\_y}
    38043213\paragraph{recalc\_y:}\label{sec:recalc_y} Tells the algorithm to recalculate the equality and inequality multipliers as least square estimates. $\;$ \\
    38053214 This asks the algorithm to recompute the
     
    38193228\end{itemize}
    38203229
    3821 \htmlanchor{sec:recalc\_y\_feas\_tol}
    38223230\paragraph{recalc\_y\_feas\_tol:}\label{sec:recalc_y_feas_tol} Feasibility threshold for recomputation of multipliers. $\;$ \\
    38233231 If recalc\_y is chosen and the current
     
    38283236
    38293237
    3830 \htmlanchor{sec:rho}
    38313238\paragraph{rho:}\label{sec:rho} Value in penalty parameter update formula. $\;$ \\
    38323239 The valid range for this real option is
     
    38353242
    38363243
    3837 \htmlanchor{sec:s\_phi}
    38383244\paragraph{s\_phi:}\label{sec:s_phi} Exponent for linear barrier function model in the switching rule. $\;$ \\
    38393245 (See Eqn. (19) in the implementation paper.) The valid range for this real option is
     
    38423248
    38433249
    3844 \htmlanchor{sec:s\_theta}
    38453250\paragraph{s\_theta:}\label{sec:s_theta} Exponent for current constraint violation in the switching rule. $\;$ \\
    38463251 (See Eqn. (19) in the implementation paper.) The valid range for this real option is
     
    38493254
    38503255
    3851 \htmlanchor{sec:skip\_corr\_if\_neg\_curv}
    38523256\paragraph{skip\_corr\_if\_neg\_curv:}\label{sec:skip_corr_if_neg_curv} Skip the corrector step in negative curvature iteration (unsupported!). $\;$ \\
    38533257 The corrector step is not tried if negative
     
    38643268\end{itemize}
    38653269
    3866 \htmlanchor{sec:skip\_corr\_in\_monotone\_mode}
    38673270\paragraph{skip\_corr\_in\_monotone\_mode:}\label{sec:skip_corr_in_monotone_mode} Skip the corrector step during monotone barrier parameter mode (unsupported!). $\;$ \\
    38683271 The corrector step is not tried if the algorithm
     
    38783281\end{itemize}
    38793282
    3880 \htmlanchor{sec:slack\_move}
    38813283\paragraph{slack\_move:}\label{sec:slack_move} Correction size for very small slacks. $\;$ \\
    38823284 Due to numerical issues or the lack of an
     
    38933295
    38943296
    3895 \htmlanchor{sec:theta\_max\_fact}
    38963297\paragraph{theta\_max\_fact:}\label{sec:theta_max_fact} Determines upper bound for constraint violation in the filter. $\;$ \\
    38973298 The algorithmic parameter theta\_max is
     
    39063307
    39073308
    3908 \htmlanchor{sec:theta\_min\_fact}
    39093309\paragraph{theta\_min\_fact:}\label{sec:theta_min_fact} Determines constraint violation threshold in the switching rule. $\;$ \\
    39103310 The algorithmic parameter theta\_min is
     
    39203320
    39213321
    3922 \htmlanchor{sec:tiny\_step\_tol}
    39233322\paragraph{tiny\_step\_tol:}\label{sec:tiny_step_tol} Tolerance for detecting numerically insignificant steps. $\;$ \\
    39243323 If the search direction in the primal variables
     
    39333332
    39343333
    3935 \htmlanchor{sec:tiny\_step\_y\_tol}
    39363334\paragraph{tiny\_step\_y\_tol:}\label{sec:tiny_step_y_tol} Tolerance for quitting because of numerically insignificant steps. $\;$ \\
    39373335 If the search direction in the primal variables
     
    39443342
    39453343
    3946 \htmlanchor{sec:watchdog\_shortened\_iter\_trigger}
    39473344\paragraph{watchdog\_shortened\_iter\_trigger:}\label{sec:watchdog_shortened_iter_trigger} Number of shortened iterations that trigger the watchdog. $\;$ \\
    39483345 If the number of successive iterations in which
     
    39553352
    39563353
    3957 \htmlanchor{sec:watchdog\_trial\_iter\_max}
    39583354\paragraph{watchdog\_trial\_iter\_max:}\label{sec:watchdog_trial_iter_max} Maximum number of watchdog iterations. $\;$ \\
    39593355 This option determines the number of trial
     
    39653361
    39663362
    3967 \subsectionH{Line search}{sec:Line_search}
    3968 \htmlanchor{sec:constraint\_violation\_norm\_type}
    3969 \paragraph{constraint\_violation\_norm\_type:}\label{sec:constraint_violation_norm_type} Norm to be used for the constraint violation in the line search. $\;$ \\
    3970  Determines which norm should be used when the
    3971 algorithm computes the constraint violation in
    3972 the line search.
    3973 The default value for this string option is "1-norm".
    3974 \\
    3975 Possible values:
    3976 \begin{itemize}
    3977    \item 1-norm: use the 1-norm
    3978    \item 2-norm: use the 2-norm
    3979    \item max-norm: use the infinity norm
    3980 \end{itemize}
    3981 
    3982 \subsectionH{Linear Solver}{sec:Linear_Solver}
    3983 \htmlanchor{sec:linear\_scaling\_on\_demand}
     3363\subsection{Linear Solver}
     3364\label{sec:Linear_Solver}
     3365\htmlanchor{sec:Linear_Solver}
    39843366\paragraph{linear\_scaling\_on\_demand:}\label{sec:linear_scaling_on_demand} Flag indicating that linear scaling is only done if it seems required. $\;$ \\
    39853367 This option is only important if a linear scaling
     
    40003382\end{itemize}
    40013383
    4002 \htmlanchor{sec:linear\_solver}
    40033384\paragraph{linear\_solver:}\label{sec:linear_solver} Linear solver used for step computations. $\;$ \\
    40043385 Determines which linear algebra package is to be
     
    40093390your Ipopt installation, not all options are
    40103391available.
    4011 The default value for this string option is "mumps".
     3392The default value for this string option is "ma27".
    40123393\\
    40133394Possible values:
     
    40153396   \item ma27: use the Harwell routine MA27
    40163397   \item ma57: use the Harwell routine MA57
     3398   \item ma77: use the Harwell routine HSL\_MA77
     3399   \item ma86: use the Harwell routine HSL\_MA86
    40173400   \item pardiso: use the Pardiso package
    40183401   \item wsmp: use WSMP package
     
    40213404\end{itemize}
    40223405
    4023 \htmlanchor{sec:linear\_system\_scaling}
    40243406\paragraph{linear\_system\_scaling:}\label{sec:linear_system_scaling} Method for scaling the linear system. $\;$ \\
    40253407 Determines the method used to compute symmetric
     
    40293411scaling.  By default, MC19 is only used if MA27
    40303412or MA57 are selected as linear solvers. This
    4031 option is only available if Ipopt has been
     3413value is only available if Ipopt has been
    40323414compiled with MC19.
    4033 The default value for this string option is "none".
     3415The default value for this string option is "mc19".
    40343416\\
    40353417Possible values:
     
    40373419   \item none: no scaling will be performed
    40383420   \item mc19: use the Harwell routine MC19
    4039 \end{itemize}
    4040 
    4041 \subsectionH{MA27 Linear Solver}{sec:MA27_Linear_Solver}
    4042 \htmlanchor{sec:ma27\_ignore\_singularity}
     3421   \item slack-based: use the slack values
     3422\end{itemize}
     3423
     3424\subsection{MA27 Linear Solver}
     3425\label{sec:MA27_Linear_Solver}
     3426\htmlanchor{sec:MA27_Linear_Solver}
    40433427\paragraph{ma27\_ignore\_singularity:}\label{sec:ma27_ignore_singularity} Enables MA27's ability to solve a linear system even if the matrix is singular. $\;$ \\
    40443428 Setting this option to "yes" means that Ipopt
     
    40583442\end{itemize}
    40593443
    4060 \htmlanchor{sec:ma27\_la\_init\_factor}
    40613444\paragraph{ma27\_la\_init\_factor:}\label{sec:ma27_la_init_factor} Real workspace memory for MA27. $\;$ \\
    40623445 The initial real workspace memory =
     
    40693452
    40703453
    4071 \htmlanchor{sec:ma27\_liw\_init\_factor}
    40723454\paragraph{ma27\_liw\_init\_factor:}\label{sec:ma27_liw_init_factor} Integer workspace memory for MA27. $\;$ \\
    40733455 The initial integer workspace memory =
     
    40803462
    40813463
    4082 \htmlanchor{sec:ma27\_meminc\_factor}
    40833464\paragraph{ma27\_meminc\_factor:}\label{sec:ma27_meminc_factor} Increment factor for workspace size for MA27. $\;$ \\
    40843465 If the integer or real workspace is not large
     
    40903471
    40913472
    4092 \htmlanchor{sec:ma27\_pivtol}
    40933473\paragraph{ma27\_pivtol:}\label{sec:ma27_pivtol} Pivot tolerance for the linear solver MA27. $\;$ \\
    40943474 A smaller number pivots for sparsity, a larger
     
    40993479
    41003480
    4101 \htmlanchor{sec:ma27\_pivtolmax}
    41023481\paragraph{ma27\_pivtolmax:}\label{sec:ma27_pivtolmax} Maximum pivot tolerance for the linear solver MA27. $\;$ \\
    41033482 Ipopt may increase pivtol as high as pivtolmax to
     
    41093488
    41103489
    4111 \htmlanchor{sec:ma27\_skip\_inertia\_check}
    41123490\paragraph{ma27\_skip\_inertia\_check:}\label{sec:ma27_skip_inertia_check} Always pretend inertia is correct. $\;$ \\
    41133491 Setting this option to "yes" essentially disables
     
    41243502\end{itemize}
    41253503
    4126 \subsectionH{MA28 Linear Solver}{sec:MA28_Linear_Solver}
    4127 \htmlanchor{sec:ma28\_pivtol}
     3504\subsection{MA28 Linear Solver}
     3505\label{sec:MA28_Linear_Solver}
     3506\htmlanchor{sec:MA28_Linear_Solver}
    41283507\paragraph{ma28\_pivtol:}\label{sec:ma28_pivtol} Pivot tolerance for linear solver MA28. $\;$ \\
    41293508 This is used when MA28 tries to find the
     
    41333512
    41343513
    4135 \subsectionH{MA57 Linear Solver}{sec:MA57_Linear_Solver}
    4136 \htmlanchor{sec:ma57\_pivot\_order}
     3514\subsection{MA57 Linear Solver}
     3515\label{sec:MA57_Linear_Solver}
     3516\htmlanchor{sec:MA57_Linear_Solver}
     3517\paragraph{ma57\_automatic\_scaling:}\label{sec:ma57_automatic_scaling} Controls MA57 automatic scaling $\;$ \\
     3518 This option controls the internal scaling option
     3519of MA57.This is ICNTL(15) in MA57.
     3520The default value for this string option is "yes".
     3521\\
     3522Possible values:
     3523\begin{itemize}
     3524   \item no: Do not scale the linear system matrix
     3525   \item yes: Scale the linear system matrix
     3526\end{itemize}
     3527
     3528\paragraph{ma57\_block\_size:}\label{sec:ma57_block_size} Controls block size used by Level 3 BLAS in MA57BD $\;$ \\
     3529 This is ICNTL(11) in MA57. The valid range for this integer option is
     3530$1 \le {\tt ma57\_block\_size } <  {\tt +inf}$
     3531and its default value is $16$.
     3532
     3533
     3534\paragraph{ma57\_node\_amalgamation:}\label{sec:ma57_node_amalgamation} Node amalgamation parameter $\;$ \\
     3535 This is ICNTL(12) in MA57. The valid range for this integer option is
     3536$1 \le {\tt ma57\_node\_amalgamation } <  {\tt +inf}$
     3537and its default value is $16$.
     3538
     3539
    41373540\paragraph{ma57\_pivot\_order:}\label{sec:ma57_pivot_order} Controls pivot order in MA57 $\;$ \\
    4138  This is INCTL(6) in MA57. The valid range for this integer option is
     3541 This is ICNTL(6) in MA57. The valid range for this integer option is
    41393542$0 \le {\tt ma57\_pivot\_order } \le 5$
    41403543and its default value is $5$.
    41413544
    41423545
    4143 \htmlanchor{sec:ma57\_pivtol}
    41443546\paragraph{ma57\_pivtol:}\label{sec:ma57_pivtol} Pivot tolerance for the linear solver MA57. $\;$ \\
    41453547 A smaller number pivots for sparsity, a larger
     
    41503552
    41513553
    4152 \htmlanchor{sec:ma57\_pivtolmax}
    41533554\paragraph{ma57\_pivtolmax:}\label{sec:ma57_pivtolmax} Maximum pivot tolerance for the linear solver MA57. $\;$ \\
    41543555 Ipopt may increase pivtol as high as
     
    41603561
    41613562
    4162 \htmlanchor{sec:ma57\_pre\_alloc}
    41633563\paragraph{ma57\_pre\_alloc:}\label{sec:ma57_pre_alloc} Safety factor for work space memory allocation for the linear solver MA57. $\;$ \\
    41643564 If 1 is chosen, the suggested amount of work
     
    41683568Ipopt has been compiled with MA57. The valid range for this real option is
    41693569$1 \le {\tt ma57\_pre\_alloc } <  {\tt +inf}$
    4170 and its default value is $3$.
    4171 
    4172 
    4173 \subsectionH{Mumps Linear Solver}{sec:Mumps_Linear_Solver}
    4174 \htmlanchor{sec:mumps\_dep\_tol}
     3570and its default value is $1.05$.
     3571
     3572
     3573\paragraph{ma57\_small\_pivot\_flag:}\label{sec:ma57_small_pivot_flag} If set to 1, then when small entries defined by CNTL(2) are detected they are removed and the corresponding pivots placed at the end of the factorization.  This can be particularly efficient if the matrix is highly rank deficient. $\;$ \\
     3574 This is ICNTL(16) in MA57. The valid range for this integer option is
     3575$0 \le {\tt ma57\_small\_pivot\_flag } \le 1$
     3576and its default value is $0$.
     3577
     3578
     3579\subsection{MA86 Linear Solver}
     3580\label{sec:MA86_Linear_Solver}
     3581\htmlanchor{sec:MA86_Linear_Solver}
     3582\paragraph{ma86\_nemin:}\label{sec:ma86_nemin} Node Amalgamation parameter $\;$ \\
     3583 Two nodes in elimination tree are merged if
     3584result has fewer than ma86\_nemin variables. The valid range for this integer option is
     3585$1 \le {\tt ma86\_nemin } <  {\tt +inf}$
     3586and its default value is $32$.
     3587
     3588
     3589\paragraph{ma86\_order:}\label{sec:ma86_order} Controls type of ordering used by HSL\_MA86 $\;$ \\
     3590 This option controls ordering for the solver
     3591HSL\_MA86.
     3592The default value for this string option is "amd".
     3593\\
     3594Possible values:
     3595\begin{itemize}
     3596   \item auto: Try both AMD and MeTiS, pick best
     3597   \item amd: Use the HSL\_MC68 approximate minimum degree
     3598algorithm
     3599   \item metis: Use the MeTiS nested dissection algorithm (if
     3600available)
     3601\end{itemize}
     3602
     3603\paragraph{ma86\_print\_level:}\label{sec:ma86_print_level} Debug printing level for the linear solver MA86 $\;$ \\
     3604 Meep The valid range for this integer option is
     3605${\tt -inf} <  {\tt ma86\_print\_level } <  {\tt +inf}$
     3606and its default value is $-1$.
     3607
     3608
     3609\paragraph{ma86\_scaling:}\label{sec:ma86_scaling} Controls scaling of matrix $\;$ \\
     3610 This option controls scaling for the solver
     3611HSL\_MA86.
     3612The default value for this string option is "mc64".
     3613\\
     3614Possible values:
     3615\begin{itemize}
     3616   \item none: Do not scale the linear system matrix
     3617   \item mc64: Scale linear system matrix using MC64
     3618   \item mc77: Scale linear system matrix using MC77 [1,3,0]
     3619\end{itemize}
     3620
     3621\paragraph{ma86\_small:}\label{sec:ma86_small} Zero Pivot Threshold $\;$ \\
     3622 Any pivot less than ma86\_small is treated as
     3623zero. The valid range for this real option is
     3624$0 \le {\tt ma86\_small } <  {\tt +inf}$
     3625and its default value is $1 \cdot 10^{-20}$.
     3626
     3627
     3628\paragraph{ma86\_static:}\label{sec:ma86_static} Static Pivoting Threshold $\;$ \\
     3629 See MA86 documentation. Either ma86\_static=0.0
     3630or ma86\_static>ma86\_small. ma86\_static=0.0
     3631disables static pivoting. The valid range for this real option is
     3632$0 \le {\tt ma86\_static } <  {\tt +inf}$
     3633and its default value is $0$.
     3634
     3635
     3636\paragraph{ma86\_u:}\label{sec:ma86_u} Pivoting Threshold $\;$ \\
     3637 See MA86 documentation. The valid range for this real option is
     3638$0 \le {\tt ma86\_u } \le 0.5$
     3639and its default value is $1 \cdot 10^{-08}$.
     3640
     3641
     3642\paragraph{ma86\_umax:}\label{sec:ma86_umax} Maximum Pivoting Threshold $\;$ \\
     3643 Maximum value to which u will be increased to
     3644improve quality. The valid range for this real option is
     3645$0 \le {\tt ma86\_umax } \le 0.5$
     3646and its default value is $0.0001$.
     3647
     3648
     3649\subsection{Mumps Linear Solver}
     3650\label{sec:Mumps_Linear_Solver}
     3651\htmlanchor{sec:Mumps_Linear_Solver}
    41753652\paragraph{mumps\_dep\_tol:}\label{sec:mumps_dep_tol} Pivot threshold for detection of linearly dependent constraints in MUMPS. $\;$ \\
    41763653 When MUMPS is used to determine linearly
     
    41823659
    41833660
    4184 \htmlanchor{sec:mumps\_mem\_percent}
    41853661\paragraph{mumps\_mem\_percent:}\label{sec:mumps_mem_percent} Percentage increase in the estimated working space for MUMPS. $\;$ \\
    41863662 In MUMPS when significant extra fill-in is caused
     
    41963672
    41973673
    4198 \htmlanchor{sec:mumps\_permuting\_scaling}
    41993674\paragraph{mumps\_permuting\_scaling:}\label{sec:mumps_permuting_scaling} Controls permuting and scaling in MUMPS $\;$ \\
    42003675 This is ICNTL(6) in MUMPS. The valid range for this integer option is
     
    42033678
    42043679
    4205 \htmlanchor{sec:mumps\_pivot\_order}
    42063680\paragraph{mumps\_pivot\_order:}\label{sec:mumps_pivot_order} Controls pivot order in MUMPS $\;$ \\
    42073681 This is ICNTL(7) in MUMPS. The valid range for this integer option is
     
    42103684
    42113685
    4212 \htmlanchor{sec:mumps\_pivtol}
    42133686\paragraph{mumps\_pivtol:}\label{sec:mumps_pivtol} Pivot tolerance for the linear solver MUMPS. $\;$ \\
    42143687 A smaller number pivots for sparsity, a larger
     
    42193692
    42203693
    4221 \htmlanchor{sec:mumps\_pivtolmax}
    42223694\paragraph{mumps\_pivtolmax:}\label{sec:mumps_pivtolmax} Maximum pivot tolerance for the linear solver MUMPS. $\;$ \\
    42233695 Ipopt may increase pivtol as high as pivtolmax to
     
    42293701
    42303702
    4231 \htmlanchor{sec:mumps\_scaling}
    42323703\paragraph{mumps\_scaling:}\label{sec:mumps_scaling} Controls scaling in MUMPS $\;$ \\
    42333704 This is ICNTL(8) in MUMPS. The valid range for this integer option is
     
    42363707
    42373708
    4238 \subsectionH{NLP}{sec:NLP}
    4239 \htmlanchor{sec:bound\_relax\_factor}
     3709\subsection{NLP}
     3710\label{sec:NLP}
     3711\htmlanchor{sec:NLP}
    42403712\paragraph{bound\_relax\_factor:}\label{sec:bound_relax_factor} Factor for initial relaxation of the bounds. $\;$ \\
    42413713 Before start of the optimization, the bounds
     
    42483720
    42493721
    4250 \htmlanchor{sec:check\_derivatives\_for\_naninf}
    42513722\paragraph{check\_derivatives\_for\_naninf:}\label{sec:check_derivatives_for_naninf} Indicates whether it is desired to check for Nan/Inf in derivative matrices $\;$ \\
    42523723 Activating this option will cause an error if an
     
    42553726not activated, the test is skipped, and the
    42563727algorithm might proceed with invalid numbers and
    4257 fail.
     3728fail.  If test is activated and an invalid number
     3729is detected, the matrix is written to output with
     3730print\_level corresponding to J\_MORE\_DETAILED;
     3731so beware of large output!
    42583732The default value for this string option is "no".
    42593733\\
     
    42643738\end{itemize}
    42653739
    4266 \htmlanchor{sec:dependency\_detection\_with\_rhs}
    42673740\paragraph{dependency\_detection\_with\_rhs:}\label{sec:dependency_detection_with_rhs} Indicates if the right hand sides of the constraints should be considered during dependency detection $\;$ \\
    42683741
     
    42753748\end{itemize}
    42763749
    4277 \htmlanchor{sec:dependency\_detector}
    42783750\paragraph{dependency\_detector:}\label{sec:dependency_detector} Indicates which linear solver should be used to detect linearly dependent equality constraints. $\;$ \\
    42793751 The default and available choices depend on how
     
    42903762\end{itemize}
    42913763
    4292 \htmlanchor{sec:fixed\_variable\_treatment}
    42933764\paragraph{fixed\_variable\_treatment:}\label{sec:fixed_variable_treatment} Determines how fixed variables should be handled. $\;$ \\
    42943765 The main difference between those options is that
     
    43133784\end{itemize}
    43143785
    4315 \htmlanchor{sec:hessian\_constant}
    43163786\paragraph{hessian\_constant:}\label{sec:hessian_constant} Indicates whether the problem is a quadratic problem $\;$ \\
    43173787 Activating this option will cause Ipopt to ask
     
    43273797\end{itemize}
    43283798
    4329 \htmlanchor{sec:honor\_original\_bounds}
    43303799\paragraph{honor\_original\_bounds:}\label{sec:honor_original_bounds} Indicates whether final points should be projected into original bounds. $\;$ \\
    43313800 Ipopt might relax the bounds during the
     
    43433812\end{itemize}
    43443813
    4345 \htmlanchor{sec:jac\_c\_constant}
    43463814\paragraph{jac\_c\_constant:}\label{sec:jac_c_constant} Indicates whether all equality constraints are linear $\;$ \\
    43473815 Activating this option will cause Ipopt to ask
     
    43593827\end{itemize}
    43603828
    4361 \htmlanchor{sec:jac\_d\_constant}
    43623829\paragraph{jac\_d\_constant:}\label{sec:jac_d_constant} Indicates whether all inequality constraints are linear $\;$ \\
    43633830 Activating this option will cause Ipopt to ask
     
    43753842\end{itemize}
    43763843
    4377 \htmlanchor{sec:kappa\_d}
    43783844\paragraph{kappa\_d:}\label{sec:kappa_d} Weight for linear damping term (to handle one-sided bounds). $\;$ \\
    43793845 (see Section 3.7 in implementation paper.) The valid range for this real option is
     
    43823848
    43833849
    4384 \htmlanchor{sec:nlp\_lower\_bound\_inf}
    43853850\paragraph{nlp\_lower\_bound\_inf:}\label{sec:nlp_lower_bound_inf} any bound less or equal this value will be considered -inf (i.e. not lower bounded). $\;$ \\
    43863851 The valid range for this real option is
     
    43893854
    43903855
    4391 \htmlanchor{sec:nlp\_upper\_bound\_inf}
    43923856\paragraph{nlp\_upper\_bound\_inf:}\label{sec:nlp_upper_bound_inf} any bound greater or this value will be considered +inf (i.e. not upper bounded). $\;$ \\
    43933857 The valid range for this real option is
     
    43963860
    43973861
    4398 \htmlanchor{sec:num\_linear\_variables}
    43993862\paragraph{num\_linear\_variables:}\label{sec:num_linear_variables} Number of linear variables $\;$ \\
    44003863 When the Hessian is approximated, it is assumed
     
    44083871
    44093872
    4410 \subsectionH{NLP Scaling}{sec:NLP_Scaling}
    4411 \htmlanchor{sec:nlp\_scaling\_constr\_target\_gradient}
     3873\subsection{NLP Scaling}
     3874\label{sec:NLP_Scaling}
     3875\htmlanchor{sec:NLP_Scaling}
    44123876\paragraph{nlp\_scaling\_constr\_target\_gradient:}\label{sec:nlp_scaling_constr_target_gradient} Target value for constraint function gradient size. $\;$ \\
    44133877 If a positive number is chosen, the scaling
     
    44213885
    44223886
    4423 \htmlanchor{sec:nlp\_scaling\_max\_gradient}
    44243887\paragraph{nlp\_scaling\_max\_gradient:}\label{sec:nlp_scaling_max_gradient} Maximum gradient after NLP scaling. $\;$ \\
    44253888 This is the gradient scaling cut-off. If the
     
    44363899
    44373900
    4438 \htmlanchor{sec:nlp\_scaling\_method}
    44393901\paragraph{nlp\_scaling\_method:}\label{sec:nlp_scaling_method} Select the technique used for scaling the NLP. $\;$ \\
    44403902 Selects the technique used for scaling the
     
    44563918\end{itemize}
    44573919
    4458 \htmlanchor{sec:nlp\_scaling\_obj\_target\_gradient}
     3920\paragraph{nlp\_scaling\_min\_value:}\label{sec:nlp_scaling_min_value} Minimum value of gradient-based scaling values. $\;$ \\
     3921 This is the lower bound for the scaling factors
     3922computed by gradient-based scaling method.  If
     3923some derivatives of some functions are huge, the
     3924scaling factors will otherwise become very small,
     3925and the (unscaled) final constraint violation,
     3926for example, might then be significant.  Note:
     3927This option is only used if
     3928"nlp\_scaling\_method" is chosen as
     3929"gradient-based". The valid range for this real option is
     3930$0 \le {\tt nlp\_scaling\_min\_value } <  {\tt +inf}$
     3931and its default value is $1 \cdot 10^{-08}$.
     3932
     3933
    44593934\paragraph{nlp\_scaling\_obj\_target\_gradient:}\label{sec:nlp_scaling_obj_target_gradient} Target value for objective function gradient size. $\;$ \\
    44603935 If a positive number is chosen, the scaling
     
    44683943
    44693944
    4470 \htmlanchor{sec:obj\_scaling\_factor}
    44713945\paragraph{obj\_scaling\_factor:}\label{sec:obj_scaling_factor} Scaling factor for the objective function. $\;$ \\
    44723946 This option sets a scaling factor for the
     
    44833957
    44843958
    4485 \subsectionH{Output}{sec:Output}
    4486 \htmlanchor{sec:file\_print\_level}
     3959\subsection{Output}
     3960\label{sec:Output}
     3961\htmlanchor{sec:Output}
    44873962\paragraph{file\_print\_level:}\label{sec:file_print_level} Verbosity level for output file. $\;$ \\
    44883963 NOTE: This option only works when read from the
     
    44943969
    44953970
    4496 \htmlanchor{sec:option\_file\_name}
     3971\paragraph{inf\_pr\_output:}\label{sec:inf_pr_output} Determines what value is printed in the "inf\_pr" output column. $\;$ \\
     3972 Ipopt works with a reformulation of the original
     3973problem, where slacks are introduced and the
     3974problem might have been scaled.  The choice
     3975"internal" prints out the constraint violation of
     3976this formulation. With "original" the true
     3977constraint violation in the original NLP is
     3978printed.
     3979The default value for this string option is "original".
     3980\\
     3981Possible values:
     3982\begin{itemize}
     3983   \item internal: max-norm of violation of internal equality
     3984constraints
     3985   \item original: maximal constraint violation in original NLP
     3986\end{itemize}
     3987
    44973988\paragraph{option\_file\_name:}\label{sec:option_file_name} File name of options file (to overwrite default). $\;$ \\
    44983989 By default, the name of the Ipopt options file is
     
    45104001\end{itemize}
    45114002
    4512 \htmlanchor{sec:output\_file}
    45134003\paragraph{output\_file:}\label{sec:output_file} File name of desired output file (leave unset for no file output). $\;$ \\
    45144004 NOTE: This option only works when read from the
     
    45264016\end{itemize}
    45274017
    4528 \htmlanchor{sec:print\_info\_string}
    45294018\paragraph{print\_info\_string:}\label{sec:print_info_string} Enables printing of additional info string at end of iteration output. $\;$ \\
    45304019 This string contains some insider information
    4531 about the current iteration.
     4020about the current iteration.  For details, look
     4021for "Diagnostic Tags" in the Ipopt documentation.
    45324022The default value for this string option is "no".
    45334023\\
     
    45384028\end{itemize}
    45394029
    4540 \htmlanchor{sec:print\_level}
    45414030\paragraph{print\_level:}\label{sec:print_level} Output verbosity level. $\;$ \\
    45424031 Sets the default verbosity level for console
     
    45474036
    45484037
    4549 \htmlanchor{sec:print\_options\_documentation}
    45504038\paragraph{print\_options\_documentation:}\label{sec:print_options_documentation} Switch to print all algorithmic options. $\;$ \\
    45514039 If selected, the algorithm will print the list of
     
    45614049\end{itemize}
    45624050
    4563 \htmlanchor{sec:print\_timing\_statistics}
    45644051\paragraph{print\_timing\_statistics:}\label{sec:print_timing_statistics} Switch to print timing statistics. $\;$ \\
    45654052 If selected, the program will print the CPU usage
     
    45734060\end{itemize}
    45744061
    4575 \htmlanchor{sec:print\_user\_options}
    45764062\paragraph{print\_user\_options:}\label{sec:print_user_options} Print all options set by the user. $\;$ \\
    45774063 If selected, the algorithm will print the list of
     
    45884074\end{itemize}
    45894075
    4590 \htmlanchor{sec:replace\_bounds}
    45914076\paragraph{replace\_bounds:}\label{sec:replace_bounds} Indicates if all variable bounds should be replaced by inequality constraints $\;$ \\
    45924077 This option must be set for the inexact algorithm
     
    46004085\end{itemize}
    46014086
    4602 \htmlanchor{sec:skip\_finalize\_solution\_call}
    46034087\paragraph{skip\_finalize\_solution\_call:}\label{sec:skip_finalize_solution_call} Indicates if call to NLP::FinalizeSolution after optimization should be suppressed $\;$ \\
    46044088 In some Ipopt applications, the user might want
     
    46154099\end{itemize}
    46164100
    4617 \subsectionH{Pardiso Linear Solver}{sec:Pardiso_Linear_Solver}
    4618 \htmlanchor{sec:pardiso\_iter\_coarse\_size}
     4101\subsection{Pardiso Linear Solver}
     4102\label{sec:Pardiso_Linear_Solver}
     4103\htmlanchor{sec:Pardiso_Linear_Solver}
    46194104\paragraph{pardiso\_iter\_coarse\_size:}\label{sec:pardiso_iter_coarse_size} Maximum Size of Coarse Grid Matrix $\;$ \\
    46204105 DPARM(3) The valid range for this integer option is
     
    46234108
    46244109
    4625 \htmlanchor{sec:pardiso\_iter\_dropping\_factor}
    46264110\paragraph{pardiso\_iter\_dropping\_factor:}\label{sec:pardiso_iter_dropping_factor} dropping value for incomplete factor $\;$ \\
    46274111 DPARM(5) The valid range for this real option is
     
    46304114
    46314115
    4632 \htmlanchor{sec:pardiso\_iter\_dropping\_schur}
    46334116\paragraph{pardiso\_iter\_dropping\_schur:}\label{sec:pardiso_iter_dropping_schur} dropping value for sparsify schur complement factor $\;$ \\
    46344117 DPARM(6) The valid range for this real option is
     
    46374120
    46384121
    4639 \htmlanchor{sec:pardiso\_iter\_inverse\_norm\_factor}
    46404122\paragraph{pardiso\_iter\_inverse\_norm\_factor:}\label{sec:pardiso_iter_inverse_norm_factor}  $\;$ \\
    46414123 DPARM(8) The valid range for this real option is
     
    46444126
    46454127
    4646 \htmlanchor{sec:pardiso\_iter\_max\_levels}
    46474128\paragraph{pardiso\_iter\_max\_levels:}\label{sec:pardiso_iter_max_levels} Maximum Size of Grid Levels $\;$ \\
    46484129 DPARM(4) The valid range for this integer option is
    46494130$1 \le {\tt pardiso\_iter\_max\_levels } <  {\tt +inf}$
    4650 and its default value is $10000$.
    4651 
    4652 
    4653 \htmlanchor{sec:pardiso\_iter\_max\_row\_fill}
     4131and its default value is $10$.
     4132
     4133
    46544134\paragraph{pardiso\_iter\_max\_row\_fill:}\label{sec:pardiso_iter_max_row_fill} max fill for each row $\;$ \\
    46554135 DPARM(7) The valid range for this integer option is
     
    46584138
    46594139
    4660 \htmlanchor{sec:pardiso\_iter\_relative\_tol}
    46614140\paragraph{pardiso\_iter\_relative\_tol:}\label{sec:pardiso_iter_relative_tol} Relative Residual Convergence $\;$ \\
    46624141 DPARM(2) The valid range for this real option is
     
    46654144
    46664145
    4667 \htmlanchor{sec:pardiso\_iterative}
    46684146\paragraph{pardiso\_iterative:}\label{sec:pardiso_iterative} Switch on iterative solver in Pardiso library $\;$ \\
    46694147
     
    46764154\end{itemize}
    46774155
    4678 \htmlanchor{sec:pardiso\_matching\_strategy}
    46794156\paragraph{pardiso\_matching\_strategy:}\label{sec:pardiso_matching_strategy} Matching strategy to be used by Pardiso $\;$ \\
    46804157 This is IPAR(13) in Pardiso manual.  This option
     
    46904167\end{itemize}
    46914168
    4692 \htmlanchor{sec:pardiso\_max\_droptol\_corrections}
    46934169\paragraph{pardiso\_max\_droptol\_corrections:}\label{sec:pardiso_max_droptol_corrections} Maximal number of decreases of drop tolerance during one solve. $\;$ \\
    46944170 This is relevant only for iterative Pardiso
     
    46984174
    46994175
    4700 \htmlanchor{sec:pardiso\_max\_iter}
    47014176\paragraph{pardiso\_max\_iter:}\label{sec:pardiso_max_iter} Maximum number of Krylov-Subspace Iteration $\;$ \\
    47024177 DPARM(1) The valid range for this integer option is
     
    47054180
    47064181
    4707 \htmlanchor{sec:pardiso\_msglvl}
    47084182\paragraph{pardiso\_msglvl:}\label{sec:pardiso_msglvl} Pardiso message level $\;$ \\
    47094183 This determines the amount of analysis output
     
    47144188
    47154189
    4716 \htmlanchor{sec:pardiso\_out\_of\_core\_power}
    47174190\paragraph{pardiso\_out\_of\_core\_power:}\label{sec:pardiso_out_of_core_power} Enables out-of-core variant of Pardiso $\;$ \\
    47184191 Setting this option to a positive integer k makes
     
    47264199
    47274200
    4728 \htmlanchor{sec:pardiso\_redo\_symbolic\_fact\_only\_if\_inertia\_wrong}
    47294201\paragraph{pardiso\_redo\_symbolic\_fact\_only\_if\_inertia\_wrong:}\label{sec:pardiso_redo_symbolic_fact_only_if_inertia_wrong} Toggle for handling case when elements were perturbed by Pardiso. $\;$ \\
    47304202 This option is only available if Ipopt has been
     
    47404212\end{itemize}
    47414213
    4742 \htmlanchor{sec:pardiso\_repeated\_perturbation\_means\_singular}
    47434214\paragraph{pardiso\_repeated\_perturbation\_means\_singular:}\label{sec:pardiso_repeated_perturbation_means_singular} Interpretation of perturbed elements. $\;$ \\
    47444215 This option is only available if Ipopt has been
     
    47554226\end{itemize}
    47564227
    4757 \htmlanchor{sec:pardiso\_skip\_inertia\_check}
    4758 \paragraph{pardiso\_skip\_inertia\_check:}\label{sec:pardiso_skip_inertia_check} Always pretent inertia is correct. $\;$ \\
     4228\paragraph{pardiso\_skip\_inertia\_check:}\label{sec:pardiso_skip_inertia_check} Always pretend inertia is correct. $\;$ \\
    47594229 Setting this option to "yes" essentially disables
    47604230inertia check. This option makes the algorithm
     
    47704240\end{itemize}
    47714241
    4772 \subsectionH{Restoration Phase}{sec:Restoration_Phase}
    4773 \htmlanchor{sec:bound\_mult\_reset\_threshold}
     4242\subsection{Restoration Phase}
     4243\label{sec:Restoration_Phase}
     4244\htmlanchor{sec:Restoration_Phase}
    47744245\paragraph{bound\_mult\_reset\_threshold:}\label{sec:bound_mult_reset_threshold} Threshold for resetting bound multipliers after the restoration phase. $\;$ \\
    47754246 After returning from the restoration phase, the
     
    47864257
    47874258
    4788 \htmlanchor{sec:constr\_mult\_reset\_threshold}
    47894259\paragraph{constr\_mult\_reset\_threshold:}\label{sec:constr_mult_reset_threshold} Threshold for resetting equality and inequality multipliers after restoration phase. $\;$ \\
    47904260 After returning from the restoration phase, the
     
    47964266
    47974267
    4798 \htmlanchor{sec:evaluate\_orig\_obj\_at\_resto\_trial}
    47994268\paragraph{evaluate\_orig\_obj\_at\_resto\_trial:}\label{sec:evaluate_orig_obj_at_resto_trial} Determines if the original objective function should be evaluated at restoration phase trial points. $\;$ \\
    48004269 Setting this option to "yes" makes the
     
    48204289\end{itemize}
    48214290
    4822 \htmlanchor{sec:expect\_infeasible\_problem}
    48234291\paragraph{expect\_infeasible\_problem:}\label{sec:expect_infeasible_problem} Enable heuristics to quickly detect an infeasible problem. $\;$ \\
    48244292 This options is meant to activate heuristics that