pub fn mu_strategy_resolves_to_adaptive(options: &OptionsList) -> boolExpand description
Whether options resolve to the adaptive μ strategy, by the rules
IpoptApplication::algorithm_builder_from_options applies:
mehrotra_algorithm=yes forces adaptive; otherwise an explicit
mu_strategy wins; otherwise a limited-memory Hessian takes upstream’s
quasi-Newton default, adaptive (gh#746), and anything else the registered
monotone.
Anything that asks “would this solve already run adaptive?” must ask this,
not read the raw mu_strategy string: under L-BFGS the string is unset and
the solve is adaptive. The second-opinion ladder read the string, so its
mu_strategy=adaptive rung re-ran a limited-memory base solve
byte-for-byte (deb7, 1610 iterations and f = 99.636943584 both times).