Fast algorithm for the cutting angle method of global optimization

DOI10.1023/A:1020256900863MaRDI QIDQ1812071zbMATH OpenOpenAlexFDO

Authors Lynn M. 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

zbMATH Keywords

global optimization

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Nonconvex programming, global optimization (90C26)

Recommendations

• Cutting angle methods in global optimization
• Cutting angle method – a tool for constrained global optimization
• An approach to the subproblem of the cutting angle method of global optimization
• Extended cutting angle method of global optimization
• An exact method for solving the subproblem of the cutting angle method of global optimization.
• Cutting angle method and a local search
• scientific article; zbMATH DE number 2068028
• Imbedding and cutting methods for global optimization and their applications
• A cut-peak function method for global optimization
• A polyhedral branch-and-cut approach to global optimization

Cited in

(21)

• Geometry and combinatorics of the cutting angle method
• Cutting angle method – a tool for constrained global optimization
• A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization
• Comparative analysis of the cutting angle and simulated annealing methods in global optimization
• Least squares splines with free knots: Global optimization approach.
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• Cutting angle method and a local search
• An approach to the subproblem of the cutting angle method of global optimization
• A multidimensional descent method for global optimization
• Bounded lower subdifferentiability optimization techniques: applications
• Local optimization method with global multidimensional search
• scientific article; zbMATH DE number 2068028 (Why is no real title available?)
• Interpolation of Lipschitz functions
• Globally optimal solutions of max-min systems
• Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY
• Modified versions of the cutting angle method.
• Cutting angle methods in global optimization
• Comparative study of RPSALG algorithm for convex semi-infinite programming
• Challenges of continuous global optimization in molecular structure prediction
• Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
• Solving DC programs using the cutting angle method

This page was built for publication: Fast algorithm for the cutting angle method of global optimization

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