Lines Matching refs:unconstrained

46 …="PETSC_DOC_OUT_ROOT_PLACEHOLDER/src/tao/unconstrained/tutorials/rosenbrock1.c.html">\$TAO_DIR/src…
52 :::{admonition} Listing: `src/tao/unconstrained/tutorials/rosenbrock1.c`
53 ```{literalinclude} /../src/tao/unconstrained/tutorials/rosenbrock1.c
841 problems (unconstrained, bound-constrained, and PDE-constrained
881 for unconstrained optimization: line search (NLS), trust region (NTR), and trust
1184 Near a local minimizer to the unconstrained optimization problem, the
1254 bound constrained and unconstrained problems.
1512 bound constrained and unconstrained problems.
1525 can solve both bound constrained and unconstrained problems.
1551 default unconstrained minimization solver and can be selected by using
1582 both bound constrained and unconstrained problems.
1614 both bound constrained and unconstrained problems.
1678 unconstrained counterparts.
1857 BNCG extends the unconstrained nonlinear conjugate gradient algorithm to
1861 Like its unconstrained counterpart, BNCG offers gradient descent and a
2269 Hence, the unconstrained optimization problem we need to solve is
2832 unconstrained objective in the form of
2843 an unconstrained objective in the form of
2883 bound-constrained variant of the LMVM method for unconstrained
2887 LMVM section in the unconstrained algorithms as well as the LMVM matrix
3109 solves an unconstrained minimization problem using the conjugate
3176 The norm of the gradient is a standard measure used by unconstrained
3199 unconstrained solvers. The sixth argument is a nonnegative steplength,