Extended cutting angle method of global optimization
From MaRDI portal
Recommendations
Cited in
(17)- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- Cutting angle methods in global optimization
- Fast algorithm for the cutting angle method of global optimization
- The modified cutting angle method for global minimization of increasing positively homogeneous functions over the unit simplex
- Interpolation of Lipschitz functions
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Cutting angle method – a tool for constrained global optimization
- A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization
- scientific article; zbMATH DE number 4051358 (Why is no real title available?)
- Solving DC programs using the cutting angle method
- Generalized cutting plane method for solving nonlinear stochastic programming problems
- Robust aggregation of compositional and interval-valued data: the mode on the unit simplex
- Multiobjective optimization by using cutting angle methods and hypervolume criterion
- An approach to the subproblem of the cutting angle method of global optimization
- Challenges of continuous global optimization in molecular structure prediction
- Aggregation functions based on penalties
- Bounded lower subdifferentiability optimization techniques: applications
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)