Lines Matching refs:bound

144 bound-constrained problems. Note that the `TaoType` variable is a string that
445 upper bounds, respectively. When no upper or lower bound exists for a
446 variable, the bound may be set to `PETSC_INFINITY` or `PETSC_NINFINITY`.
447 After the two bound vectors have been set, they may be accessed with the
450 Since not all solvers recognize the presence of bound constraints on
557 function for bound-constrained problems) is sufficiently close to zero.
841 problems (unconstrained, bound-constrained, and PDE-constrained
1254 bound constrained and unconstrained problems.
1512 bound constrained and unconstrained problems.
1525 can solve both bound constrained and unconstrained problems.
1582 both bound constrained and unconstrained problems.
1614 both bound constrained and unconstrained problems.
1674 For any unbounded variables, the bound value for the associated index
1675 can be set to `PETSC_INFINITY` for the upper bound and
1676 `PETSC_NINFINITY` for the lower bound. If all bounds are set to
1681 operations used by all bound constrained algorithms.
1737 At each iteration, the bound tolerance is estimated as
1741 $H_k^{-1}$. The initial bound tolerance $\epsilon_0$ and the
1746 current iterate with no bound tolerances to determine which variables
1858 bound constraints via gradient projections and a bounded Moré-Thuente
1927 and no look-ahead step. As in the BNK algorithm, the initial bound
2036 of bound constrained problems at each outer iteration
2062 The inner subproblem is solved using a nested bound-constrained
2476 bound-constrained quadratic program, it may not be convex and the BQPIP
2655 bound-constrained optimization case, these conditions correspond to
2659 is at the lower bound, then the function must be increasing and
2660 $\nabla f \geq 0$. If the solution is at the upper bound, then the
2819 The BQPIP algorithm is an interior-point method for bound constrained
2883 bound-constrained variant of the LMVM method for unconstrained