A modified quasisecant method for global optimization

DOI10.1016/j.apm.2017.06.033zbMath1480.90205OpenAlexW2680963168MaRDI QIDQ2294744

Qiang Long, Xiangyu Wang, Changzhi Wu, Zhi-You Wu

Publication date: 12 February 2020

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2017.06.033

zbMATH Keywords

global optimizationhybrid methodquasisecant methodsensor localization problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

Uses Software

• Algorithm 829
• SFSDP
• QSM

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Global optimization using a genetic algorithm with hierarchically structured population
• Global descent methods for unconstrained global optimization
• (Robust) edge-based semidefinite programming relaxation of sensor network localization
• A filled function method for finding a global minimizer of a function of several variables
• A branch and bound method for stochastic global optimization
• Lipschitzian optimization without the Lipschitz constant
• Cutting angle method and a local search
• A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization
• A hybrid descent method for global optimization
• Globally-biased disimpl algorithm for expensive global optimization
• Chaos-enhanced Cuckoo search optimization algorithms for global optimization
• A hybrid conjugate gradient method with descent property for unconstrained optimization
• A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization
• Algorithm 920
• Comparison of deterministic and stochastic approaches to global optimization
• Global Descent Method for Global Optimization
• The Cutting-Plane Method for Solving Convex Programs
• A quasisecant method for minimizing nonsmooth functions
• Finding the nearest point in A polytope
• Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
• A multidimensional descent method for global optimization
• Algorithm 829
• A Simplex Method for Function Minimization
• A locally-biased form of the DIRECT algorithm.

This page was built for publication: A modified quasisecant method for global optimization