Fast algorithm for the cutting angle method of global optimization
From MaRDI portal
Publication:1812071
DOI10.1023/A:1020256900863zbMath1047.90044OpenAlexW1591248997MaRDI QIDQ1812071
Lynn Margaret Batten, Gleb Beliakov
Publication date: 18 June 2003
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1020256900863
Nonconvex programming, global optimization (90C26) Complexity and performance of numerical algorithms (65Y20)
Related Items (15)
Cutting angle method – a tool for constrained global optimization ⋮ A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization ⋮ Challenges of continuous global optimization in molecular structure prediction ⋮ Globally optimal solutions of max-min systems ⋮ Least squares splines with free knots: Global optimization approach. ⋮ Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) ⋮ Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY ⋮ Solving DC programs using the cutting angle method ⋮ Bounded lower subdifferentiability optimization techniques: applications ⋮ Interpolation of Lipschitz functions ⋮ A multidimensional descent method for global optimization ⋮ Comparative study of RPSALG algorithm for convex semi-infinite programming ⋮ Comparative analysis of the cutting angle and simulated annealing methods in global optimization ⋮ Geometry and combinatorics of the cutting angle method ⋮ Local optimization method with global multidimensional search
This page was built for publication: Fast algorithm for the cutting angle method of global optimization
