Geometry and combinatorics of the cutting angle method

DOI10.1080/02331930310001611556zbMath1055.65071OpenAlexW2000681087MaRDI QIDQ4467168

Gleb Beliakov

Publication date: 9 June 2004

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930310001611556

zbMATH Keywords

global optimizationLipschitz optimizationcutting angle methodpiecewise linear approximationRandom number generatorsaw tooth cover

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Random number generation in numerical analysis (65C10)

Related Items (13)

Cutting angle method – a tool for constrained global optimization ⋮ Absorbent tuples of aggregation operators ⋮ POINTWISE CONSTRUCTION OF LIPSCHITZ AGGREGATION OPERATORS WITH SPECIFIC PROPERTIES ⋮ A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization ⋮ Challenges of continuous global optimization in molecular structure prediction ⋮ A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem ⋮ Generalized cutting plane method for solving nonlinear stochastic programming problems ⋮ Solving DC programs using the cutting angle method ⋮ Implementation of novel methods of global and nonsmooth optimization: GANSO programming library ⋮ Bounded lower subdifferentiability optimization techniques: applications ⋮ Interpolation of Lipschitz functions ⋮ Comparative study of RPSALG algorithm for convex semi-infinite programming ⋮ Learning weights in the generalized OWA operators

Uses Software

• LGO

Cites Work

• Unnamed Item
• Voronoi diagrams in higher dimensions under certain polyhedral distance functions
• Cutting angle methods in global optimization
• Fast algorithm for the cutting angle method of global optimization
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• An algorithm for finding the global maximum of a multimodal, multivariate function
• A rejection technique for sampling from T -concave distributions
• Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
• Adaptive Rejection Metropolis Sampling within Gibbs Sampling
• An algorithm for finding the absolute extremum of a function
• A Sequential Method Seeking the Global Maximum of a Function
• Introduction to global optimization.
• Global minimization of increasing positively homogeneous functions over the unit simplex
• Abstract convexity and global optimization

This page was built for publication: Geometry and combinatorics of the cutting angle method