Cutting angle methods in global optimization

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

Yanyan Li

Publication date: 25 November 1999

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

zbMATH Keywords

global optimization; subdifferential; cutting angle method; abstract convexity; increasing; convex-along-rays; generalized cutting plane method

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C26: Nonconvex programming, global optimization

Related Items

Comparative analysis of the cutting angle and simulated annealing methods in global optimization, Geometry and combinatorics of the cutting angle method, Computing near-optimal solutions for the dominating subset with minimal weight problem, Abstract convexity:examples and applications, A multidimensional descent method for global optimization, A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization, An approach to the subproblem of the cutting angle method of global optimization, Challenges of continuous global optimization in molecular structure prediction, 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, Local optimization method with global multidimensional search, On the global minimization of increasing positively homogeneous functions over the unit simplex, Cutting angle method – a tool for constrained 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