A family of global convergent inexact secant methods for nonconvex constrained optimization
2018 ◽
Vol 12
(2)
◽
pp. 165-176
Keyword(s):
We present a family of new inexact secant methods in association with Armijo line search technique for solving nonconvex constrained optimization. Different from the existing inexact secant methods, the algorithms proposed in this paper need not compute exact directions. By adopting the nonsmooth exact penalty function as the merit function, the global convergence of the proposed algorithms is established under some reasonable conditions. Some numerical results indicate that the proposed algorithms are both feasible and effective.
2005 ◽
Vol 25
(1)
◽
pp. 170-178
◽
A Simulated Annealing-Based Barzilai–Borwein Gradient Method for Unconstrained Optimization Problems
2019 ◽
Vol 36
(04)
◽
pp. 1950017
◽
2017 ◽
Vol 73
(2)
◽
pp. 277-293
◽
Keyword(s):
2013 ◽
Vol 3
(2)
◽
pp. 145-152
2016 ◽
Vol 38
(1)
◽
pp. 110-137
Keyword(s):