A Modified Derivative-Free Algorithm for Bound Constrained Optimization

2006 ◽  
Author(s):  
Yan Li ◽  
Qing-hua Zhou
Keyword(s):  
Constrained Optimization ◽  
Derivative Free ◽  
Bound Constrained Optimization

scholarly journals A Derivative-Free Trust Region Algorithm with Nonmonotone Filter Technique for Bound Constrained Optimization

2018 ◽  
Vol 2018 ◽  
pp. 1-13
Author(s):  
Jing Gao ◽  
Jian Cao ◽  
Yueting Yang
Keyword(s):  
Constrained Optimization ◽  
Optimization Problems ◽  
Trust Region ◽  
Computational Time ◽  
Test Problems ◽  
Trust Region Algorithm ◽  
Filter Technique ◽  
Derivative Free ◽  
Bound Constrained Optimization ◽  
Parameter Values

We propose a derivative-free trust region algorithm with a nonmonotone filter technique for bound constrained optimization. The derivative-free strategy is applied for special minimization functions in which derivatives are not all available. A nonmonotone filter technique ensures not only the trust region feature but also the global convergence under reasonable assumptions. Numerical experiments demonstrate that the new algorithm is effective for bound constrained optimization. Locally, optimal parameters with respect to overall computational time on a set of test problems are identified. The performance of the best choice of parameter values obtained by the algorithm we presented which differs from traditionally used values indicates that the algorithm proposed in this paper has a certain advantage for the nondifferentiable optimization problems.

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

A derivative-free algorithm for spherically constrained optimization

2020 ◽  
Vol 76 (4) ◽  
pp. 841-861
Author(s):  
Min Xi ◽  
Wenyu Sun ◽  
Yannan Chen ◽  
Hailin Sun
Keyword(s):  
Constrained Optimization ◽  
Derivative Free

A progressive barrier derivative-free trust-region algorithm for constrained optimization

2018 ◽  
Vol 71 (2) ◽  
pp. 307-329 ◽  
Author(s):  
Charles Audet ◽  
Andrew R. Conn ◽  
Sébastien Le Digabel ◽  
Mathilde Peyrega
Keyword(s):  
Constrained Optimization ◽  
Trust Region ◽  
Trust Region Algorithm ◽  
Derivative Free
Sign in / Sign up

Export Citation Format

Share Document