Cutting angle method – a tool for constrained global optimization
From MaRDI portal
Publication:3156719
DOI10.1080/10556780410001647177zbMath1054.90055OpenAlexW2086529693MaRDI QIDQ3156719
Publication date: 11 January 2005
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780410001647177
Related Items
DETECTING K-COMPLEXES FOR SLEEP STAGE IDENTIFICATION USING NONSMOOTH OPTIMIZATION ⋮ Absorbent tuples of aggregation operators ⋮ POINTWISE CONSTRUCTION OF LIPSCHITZ AGGREGATION OPERATORS WITH SPECIFIC PROPERTIES ⋮ Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients ⋮ Challenges of continuous global optimization in molecular structure prediction ⋮ A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem ⋮ Optimizing the principal eigenvalue of the Laplacian in a sphere with interior traps ⋮ Generalized cutting plane method for solving nonlinear stochastic programming problems ⋮ Solving DC programs using the cutting angle method ⋮ Global non-smooth optimization in robust multivariate regression ⋮ Bounded lower subdifferentiability optimization techniques: applications ⋮ Comparative study of RPSALG algorithm for convex semi-infinite programming
Cites Work
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Cutting angle methods in global optimization
- Fast algorithm for the cutting angle method of global optimization
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Geometry and combinatorics of the cutting angle method
- 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
