Extended cutting angle method of global optimization
From MaRDI portal
Publication:5453761
zbMATH Open1192.90145MaRDI QIDQ5453761FDOQ5453761
Authors: Gleb Beliakov 
Publication date: 3 April 2008
Recommendations
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Cited In (16)
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Generalized cutting plane method for solving nonlinear stochastic programming problems
- Robust aggregation of compositional and interval-valued data: the mode on the unit simplex
- Aggregation functions based on penalties
- Cutting angle method – a tool for constrained global optimization
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- The modified cutting angle method for global minimization of increasing positively homogeneous functions over the unit simplex
- Interpolation of Lipschitz functions
- Solving DC programs using the cutting angle method
- A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization
- Bounded lower subdifferentiability optimization techniques: applications
- Challenges of continuous global optimization in molecular structure prediction
- Title not available (Why is that?)
- An approach to the subproblem of the cutting angle method of global optimization
- Cutting angle methods in global optimization
- Fast algorithm for the cutting angle method of global optimization
Uses Software
This page was built for publication: Extended 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 Q5453761)
