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