A Nonmonotone Line Search Slackness Technique for Unconstrained Optimization

Ping Hu () and Xu-Qing Liu ()
Additional contact information
Ping Hu: Huaiyin Institute of Technology
Xu-Qing Liu: Huaiyin Institute of Technology

Journal of Optimization Theory and Applications, 2013, vol. 158, issue 3, No 7, 773-786

Abstract: Abstract This paper mainly aims to study a new nonmonotone line search slackness technique for unconstrained optimization problems and show that it possesses the global convergence without needing condition of convexity. We establish the corresponding algorithm and illustrate its effectiveness by virtue of some numerical tests. Simulation results indicate that the proposed method is very effective for non-convex functions.

Keywords: Unconstrained optimization problem; Nonmonotone line search slackness technique; BFGS algorithm (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-012-0247-7 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:158:y:2013:i:3:d:10.1007_s10957-012-0247-7

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-012-0247-7

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 ().