Cutting angle methods in global optimization

DOI10.1016/S0893-9659(98)00179-7zbMath0944.90063OpenAlexW2004572490MaRDI QIDQ1808534

Yanyan Li

Publication date: 25 November 1999

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(98)00179-7

zbMATH Keywords

global optimizationsubdifferentialcutting angle methodabstract convexityincreasingconvex-along-raysgeneralized cutting plane method

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items

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 ⋮ Radiant separation theorems and minimum-type subdifferentials of calm functions ⋮ Globally optimal solutions of max-min systems ⋮ An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming ⋮ Generalized cutting plane method for solving nonlinear stochastic programming problems ⋮ Least squares splines with free knots: Global optimization approach. ⋮ Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) ⋮ Computing near-optimal solutions for the dominating subset with minimal weight problem ⋮ A multidimensional descent method for global optimization ⋮ On the global minimization of increasing positively homogeneous functions over the unit simplex ⋮ Abstract convexity:examples and applications ⋮ 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 ⋮ An approach to the subproblem of the cutting angle method of global optimization

Uses Software

• LGO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The bisection method in higher dimensions
• Increasing convex-along-rays functions with applications to global optimization
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• The Cutting-Plane Method for Solving Convex Programs
• An algorithm for finding the global maximum of a multimodal, multivariate function