Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    A modified quasisecant method for global optimization

    Access Status
    Fulltext not available
    Authors
    Long, Q.
    Wu, Changzhi
    Wang, Xiangyu
    Wu, Z.
    Date
    2017
    Type
    Journal Article
    
    Metadata
    Show full item record
    Citation
    Long, Q. and Wu, C. and Wang, X. and Wu, Z. 2017. A modified quasisecant method for global optimization. Applied Mathematical Modelling. 51: pp. 21-37.
    Source Title
    Applied Mathematical Modelling
    DOI
    10.1016/j.apm.2017.06.033
    ISSN
    0307-904X
    School
    Department of Construction Management
    URI
    http://hdl.handle.net/20.500.11937/57291
    Collection
    • Curtin Research Publications
    Abstract

    © 2017 Elsevier Inc. This paper presents an algorithm for global optimization problem whose objective functions is Lipschitz continuous but not necessarily differentiable. The proposed algorithm consists of local and global search procedures which are based on and inspired by quasisecant method, respectively. The aim of the global search procedure is to identify “promising” basins in the search space. Once a promising basin is identified, the search procedure skips from an exhausted area to the obtained basin, and the local search procedure is then applied at this basin. It proves that the proposed algorithm converges to the global minimum solution if the local ones are finite and isolated. The proposed method is tested by academic benchmarks, numerical performance and comparison show that it is efficient and robust. Finally, The method is applied to solve the sensor localization problem.

    Related items

    Showing items related by title, author, creator and subject.

    • Heuristic algorithms for routing problems.
      Chong, Yen N. (2001)
      General routing problems deal with transporting some commodities and/or travelling along the axes of a given network in some optimal manner. In the modern world such problems arise in several contexts such as distribution ...
    • Integer Least-squares Theory for the GNSS Compass
      Teunissen, Peter (2010)
      Global navigation satellite system (GNSS) carrier phase integer ambiguity resolution is the key to high-precision positioning and attitude determination. In this contribution, we develop new integer least-squares (ILS) ...
    • Global algorithms for nonlinear discrete optimization and discrete-valued optimal control problems
      Woon, Siew Fang (2009)
      Optimal control problems arise in many applications, such as in economics, finance, process engineering, and robotics. Some optimal control problems involve a control which takes values from a discrete set. These problems ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.