A New Nonsmooth Trust Region Algorithm for Locally Lipschitz Unconstrained Optimization Problems
Z. Akbari (),
R. Yousefpour () and
M. Reza Peyghami ()
Additional contact information
Z. Akbari: K.N. Toosi University of Technology
R. Yousefpour: University of Mazandaran
M. Reza Peyghami: K.N. Toosi University of Technology
Journal of Optimization Theory and Applications, 2015, vol. 164, issue 3, No 2, 733-754
Abstract:
Abstract In this paper, a new nonsmooth trust region algorithm is proposed for solving unconstrained minimization problems with locally Lipschitz objective functions. At first, by using an approximation of the steepest descent direction, a local model is presented for locally Lipschitz functions. More precisely, in the quadratic model of classical trust region methods, the gradient vector is replaced by an approximation of the steepest descent direction. We then apply one of the efficient approaches of classical trust region methods in order to solve the obtained model. Using the BFGS updating formula for the Hessian approximation of the model, we show that the proposed algorithm is convergent under some mild and standard conditions on the objective function. Finally, the presented algorithm is implemented in the MATLAB environment and applied on some nonsmooth test problems.
Keywords: Trust region method; Lipschitz functions; Quadratic local model; CG-Steihaug method; 49J52; 90C26 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://link.springer.com/10.1007/s10957-014-0534-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:164:y:2015:i:3:d:10.1007_s10957-014-0534-6
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1007/s10957-014-0534-6
Access Statistics for this article
Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull
More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().