scholarly journals An accurate active set newton algorithm for large scale bound constrained optimization

2011 ◽  
Vol 56 (3) ◽  
pp. 297-314 ◽  
Author(s):  
Li Sun ◽  
Guoping He ◽  
Yongli Wang ◽  
Changyin Zhou
Author(s):  
Morteza Kimiaei

AbstractThis paper discusses an active set trust-region algorithm for bound-constrained optimization problems. A sufficient descent condition is used as a computational measure to identify whether the function value is reduced or not. To get our complexity result, a critical measure is used which is computationally better than the other known critical measures. Under the positive definiteness of approximated Hessian matrices restricted to the subspace of non-active variables, it will be shown that unlimited zigzagging cannot occur. It is shown that our algorithm is competitive in comparison with the state-of-the-art solvers for solving an ill-conditioned bound-constrained least-squares problem.


2016 ◽  
Vol 172 (2) ◽  
pp. 369-401 ◽  
Author(s):  
Andrea Cristofari ◽  
Marianna De Santis ◽  
Stefano Lucidi ◽  
Francesco Rinaldi

Sign in / Sign up

Export Citation Format

Share Document