TRON

TRON is a trust region Newton method for the solution of large bound-constrained optimization problems. TRON uses a gradient projection method to generate a Cauchy step, a preconditioned conjugate gradient method with an incomplete Cholesky factorization to generate a direction, and a projected search to compute the step. The use of projected searches, in particular, allows TRON to examine faces of the feasible set by generating a small number of minor iterates, even for problems with a large number of variables. As a result TRON is remarkably efficient at solving large bound-constrained optimization problems.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 100 articles , 1 standard article )

Showing results 1 to 20 of 100.
Sorted by year (citations)

1 2 3 4 5 next

  1. Barbero, Álvaro; Sra, Suvrit: Modular proximal optimization for multidimensional total-variation regularization (2018)
  2. Bottou, Léon; Curtis, Frank E.; Nocedal, Jorge: Optimization methods for large-scale machine learning (2018)
  3. Piccialli, Veronica; Sciandrone, Marco: Nonlinear optimization and support vector machines (2018)
  4. Yan, Xihong; Wang, Kai; He, Hongjin: On the convergence rate of scaled gradient projection method (2018)
  5. Belachew, Melisew Tefera; Gillis, Nicolas: Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation (2017)
  6. Caudillo-Mata, L. A.; Haber, E.; Heagy, L. J.; Schwarzbach, C.: A framework for the upscaling of the electrical conductivity in the quasi-static Maxwell’s equations (2017)
  7. Chen, Tianyi; Curtis, Frank E.; Robinson, Daniel P.: A reduced-space algorithm for minimizing (\ell_1)-regularized convex functions (2017)
  8. Cristofari, Andrea; De Santis, Marianna; Lucidi, Stefano; Rinaldi, Francesco: A two-stage active-set algorithm for bound-constrained optimization (2017)
  9. Stiegelmeier, Elenice W.; Oliveira, Vilma A.; Silva, Geraldo N.; Karam, Décio: Optimal weed population control using nonlinear programming (2017)
  10. Arreckx, Sylvain; Lambe, Andrew; Martins, Joaquim R. R. A.; Orban, Dominique: A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization (2016)
  11. Dong, Jun-Liang; Gao, Junbin; Ju, Fujiao; Shen, Jinghua: Modulus methods for nonnegatively constrained image restoration (2016)
  12. Hager, William W.; Zhang, Hongchao: An active set algorithm for nonlinear optimization with polyhedral constraints (2016)
  13. Rahpeymaii, Farzad; Kimiaei, Morteza; Bagheri, Alireza: A limited memory quasi-Newton trust-region method for box constrained optimization (2016)
  14. Bui-Thanh, Tan; Ghattas, Omar: A scalable algorithm for MAP estimators in Bayesian inverse problems with Besov priors (2015)
  15. Hu, Li-Ying; Guo, Gong-De; Ma, Chang-Feng: Image processing using Newton-based algorithm of nonnegative matrix factorization (2015)
  16. Peyghami, M. Reza; Tarzanagh, D. Ataee: A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems (2015)
  17. Tarzanagh, D. Ataee; Peyghami, M. Reza; Bastin, F.: A new nonmonotone adaptive retrospective trust region method for unconstrained optimization problems (2015)
  18. Yuan, Gonglin; Wei, Zengxin; Zhang, Maojun: An active-set projected trust region algorithm for box constrained optimization problems (2015)
  19. Cheng, Wanyou; Chen, Zixin; Li, Dong-hui: An active set truncated Newton method for large-scale bound constrained optimization (2014)
  20. Cheng, Wanyou; Liu, Qunfeng; Li, Donghui: An accurate active set conjugate gradient algorithm with project search for bound constrained optimization (2014)

1 2 3 4 5 next