152 = parlist.sublist(
"Step").sublist(
"Line Search").sublist(
"Descent Method").get(
"Type",
"Newton-Krylov");
153 if (desc==
"Newton-Krylov" || desc==
"Newton")
154 return makePtr<NewtonKrylovAlgorithm<Real>>(parlist);
155 else if (desc==
"Quasi-Newton Method") {
157 = parlist.sublist(
"Step").sublist(
"Line Search").sublist(
"Quasi-Newton").get(
"Method",
"L-Secant-B");
158 if (method ==
"L-Secant-B")
159 return makePtr<LSecantBAlgorithm<Real>>(parlist);
161 return makePtr<QuasiNewtonAlgorithm<Real>>(parlist);
164 return makePtr<GradientAlgorithm<Real>>(parlist);
170 = parlist.sublist(
"Step").sublist(
"Trust Region").get(
"Subproblem Model",
"Lin-More");
171 if (trmod==
"Kelley-Sachs")
172 return makePtr<KelleySachsAlgorithm<Real>>(parlist);
173 else if (trmod==
"SPG")
174 return makePtr<TrustRegionSPGAlgorithm<Real>>(parlist);
175 else if (trmod==
"Coleman-Li")
176 return makePtr<ColemanLiAlgorithm<Real>>(parlist);
178 return makePtr<LinMoreAlgorithm<Real>>(parlist);
184 default:
return nullPtr;