Modified versions of the cutting angle method.
From MaRDI portal
Publication:2768047
zbMATH Open1049.90061MaRDI QIDQ2768047FDOQ2768047
Authors: A. M. Bagirov, A. M. Rubinov 
Publication date: 2001
Recommendations
- Fast algorithm for the cutting angle method of global optimization
- Cutting angle methods in global optimization
- Cutting angle method and a local search
- An exact method for solving the subproblem of the cutting angle method of global optimization.
- The modified cutting angle method for global minimization of increasing positively homogeneous functions over the unit simplex
Cited In (15)
- Title not available (Why is that?)
- Comparative analysis of the cutting angle and simulated annealing methods in global optimization
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Least squares splines with free knots: Global optimization approach.
- Cutting angle method – a tool for constrained global optimization
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- A revised cut-peak function method for box constrained continuous global optimization
- Title not available (Why is that?)
- Solving DC programs using the cutting angle method
- Bounded lower subdifferentiability optimization techniques: applications
- Global optimization of marginal functions with applications to economic equilibrium.
- A multidimensional descent method for global optimization
- Cutting angle method and a local search
- A review of applications of the cutting angle methods
This page was built for publication: Modified versions of the cutting angle method.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768047)
