A modified quasisecant method for global optimization

DOI10.1016/J.APM.2017.06.033MaRDI QIDQ2294744zbMATH OpenOpenAlexFDO

Authors Qiang Long, Changzhi Wu, Xiangyu Wang, Zhiyou 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)

Recommendations

• A modified secant equation quasi-Newton method for unconstrained optimization
• A Modified Quasi‐Newton Method for Optimization in Simulation
• A modified SQP method and its global convergence
• A modified SQP method and its global convergence
• A new quasi-filled function method for constrained global optimization
• A modified Quasi-Newton method for vector optimization problem
• A quasisecant method for minimizing nonsmooth functions
• A global optimization algorithm for generalized quadratic programming
• scientific article; zbMATH DE number 624796
• A method of global optimization for indefinite quadratic programming problems

Cites work

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

Cited in

(1)

• An intlab based global optimization method and its application to a sensor network localization problem

Describes a project that uses

Uses Software

• QSM
• SFSDP
• Algorithm 829

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294744)