A modified quasisecant method for global optimization

DOI10.1016/J.APM.2017.06.033zbMATH Open1480.90205OpenAlexW2680963168MaRDI QIDQ2294744FDOQ2294744

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

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

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)

Cites Work

• Algorithm 829
• Optimization by simulated annealing
• A filled function method for finding a global minimizer of a function of several variables
• A Simplex Method for Function Minimization
• A locally-biased form of the DIRECT algorithm.
• Lipschitzian optimization without the Lipschitz constant
• A quasisecant method for minimizing nonsmooth functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Cutting-Plane Method for Solving Convex Programs
• Global descent method for global optimization
• Finding the nearest point in A polytope
• Global descent methods for unconstrained global optimization
• A branch and bound method for stochastic global optimization
• Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems
• Globally-biased disimpl algorithm for expensive global optimization
• A hybrid conjugate gradient method with descent property for unconstrained optimization
• Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
• Cutting angle method and a local search
• A hybrid descent method for global optimization
• Global optimization using a genetic algorithm with hierarchically structured population
• 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
• (Robust) edge-based semidefinite programming relaxation of sensor network localization
• A multidimensional descent method for global optimization
• Comparison of deterministic and stochastic approaches to global optimization
• Chaos-enhanced Cuckoo search optimization algorithms for global optimization

Cited In (1)

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

Uses Software

• Algorithm 829
• SFSDP
• QSM

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)