Global minimization of increasing positively homogeneous functions over the unit simplex

DOI10.1023/A:1019204407420MaRDI QIDQ5933816zbMATH OpenFDO

Authors A. M. Bagirov, A. M. Rubinov

Publication date 14 June 2001

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

Full work available at URL https://doi.org/10.1023/A:1019204407420

zbMATH Keywords

cutting angle methodglobal optimizationincreasing positively homogeneous function

Mathematics Subject Classification ID

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

Recommendations

• The modified cutting angle method for global minimization of increasing positively homogeneous functions over the unit simplex
• On the global minimization of increasing positively homogeneous functions over the unit simplex
• Global minimization of increasing positively homogeneous functions with a single constraint
• An exact method for solving the subproblem of the cutting angle method of global optimization.
• Cutting angle methods in global optimization

Cited in

(28)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5933816)