Global minimization of increasing positively homogeneous functions over the unit simplex

DOI10.1023/A:1019204407420zbMath0990.90117MaRDI QIDQ5933816

Adil M. Bagirov, Alexander Rubinov

Publication date: 14 June 2001

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

global optimizationcutting angle methodincreasing positively homogeneous function

Mathematics Subject Classification ID

Semi-infinite programming (90C34) Discrete approximations in optimal control (49M25)

Related Items (21)

Cutting angle method – a tool for constrained global optimization ⋮ A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization ⋮ On KKT points of homogeneous programs ⋮ A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem ⋮ Least squares splines with free knots: Global optimization approach. ⋮ Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) ⋮ On the complexity of optimization over the standard simplex ⋮ Solving DC programs using the cutting angle method ⋮ Abstract convexity, global optimization and data classification. ⋮ Global non-smooth optimization in robust multivariate regression ⋮ Penalty functions with a small penalty parameter ⋮ Global minimization of the difference of strictly non-positive valued affine ICR functions ⋮ Classes and clusters in data analysis ⋮ A multidimensional descent method for global optimization ⋮ On the global minimization of increasing positively homogeneous functions over the unit simplex ⋮ Comparative study of RPSALG algorithm for convex semi-infinite programming ⋮ Comparative analysis of the cutting angle and simulated annealing methods in global optimization ⋮ Geometry and combinatorics of the cutting angle method ⋮ Global optimization of the difference of affine increasing and positively homogeneous functions ⋮ Local optimization method with global multidimensional search ⋮ An approach to the subproblem of the cutting angle method of global optimization

This page was built for publication: Global minimization of increasing positively homogeneous functions over the unit simplex