:orphan:
# TAOTRON
The TRON algorithm is an active-set Newton trust region method for bound-constrained minimization. 
## Options Database Keys

- ***-tao_tron_maxgpits -*** maximum number of gradient projections per TRON iterate
- ***-tao_subset_type -*** "subvec","mask","matrix-free", strategies for handling active-sets




## Level
beginner

## Location
<A HREF="PETSC_DOC_OUT_ROOT_PLACEHOLDER/src/tao/bound/impls/tron/tron.c.html#TAOTRON">src/tao/bound/impls/tron/tron.c</A>

## Examples
<A HREF="PETSC_DOC_OUT_ROOT_PLACEHOLDER/src/tao/bound/tutorials/jbearing2.c.html">src/tao/bound/tutorials/jbearing2.c</A><BR>


---
[Edit on GitLab](https://gitlab.com/petsc/petsc/-/edit/release/src/tao/bound/impls/tron/tron.c)


[Index of all Tao routines](index.md)  
[Table of Contents for all manual pages](/manualpages/index.md)  
[Index of all manual pages](/manualpages/singleindex.md)