A multidimensional descent method for global optimization

DOI10.1080/02331930902943483zbMath1167.49028OpenAlexW2042616586MaRDI QIDQ5193141

Jiapu Zhang, Adil M. Bagirov, Alexander Rubinov

Publication date: 11 August 2009

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930902943483

zbMATH Keywords

global optimizationderivative-free optimizationdiscrete gradientLipschitz programmingthe cutting angle method

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Discrete approximations in optimal control (49M25)

Related Items (5)

A new global optimization technique by auxiliary function method in a directional search ⋮ Continuous global optimization through the generation of parametric curves ⋮ A deterministic method for continuous global optimization using a dense curve ⋮ A convergence analysis of the method of codifferential descent ⋮ A modified quasisecant method for global optimization

Uses Software

• Global Optimization Toolbox For Maple

Cites Work

• Unnamed Item
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• Cutting angle method and a local search
• A hybrid descent method for global optimization
• Cutting angle methods in global optimization
• Fast algorithm for the cutting angle method of global optimization
• Local optimization method with global multidimensional search
• Finding the nearest point in A polytope
• Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
• Lipschitz programming via increasing convex-along-rays functions^*
• A Method for Minimization of Quasidifferentiable Functions
• Global minimization of increasing positively homogeneous functions over the unit simplex

This page was built for publication: A multidimensional descent method for global optimization