Spherical Search Algorithm: A Metaheuristic for Bound-Constrained Optimization

2021 ◽  
pp. 421-441
Author(s):  
Rakesh Kumar Misra ◽  
Devender Singh ◽  
Abhishek Kumar
Keyword(s):  
Constrained Optimization ◽  
Search Algorithm ◽  
Bound Constrained Optimization

scholarly journals An Active Set Trust-Region Method for Bound-Constrained Optimization

2021 ◽  
Author(s):  
Morteza Kimiaei
Keyword(s):  
Constrained Optimization ◽  
Optimization Problems ◽  
Trust Region Method ◽  
Trust Region ◽  
Positive Definiteness ◽  
Active Set ◽  
Sufficient Descent Condition ◽  
Critical Measure ◽  
Complexity Result ◽  
Bound Constrained Optimization

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.

scholarly journals A Limited Memory Algorithm for Bound Constrained Optimization

1995 ◽  
Vol 16 (5) ◽  
pp. 1190-1208 ◽  
Author(s):  
Richard H. Byrd ◽  
Peihuang Lu ◽  
Jorge Nocedal ◽  
Ciyou Zhu
Keyword(s):  
Constrained Optimization ◽  
Limited Memory ◽  
Bound Constrained Optimization
Sign in / Sign up

Export Citation Format

Share Document