On the global minimization of increasing positively homogeneous functions over the unit simplex

DOI10.1080/00207160902745341zbMATH Open1207.49028OpenAlexW2032955856MaRDI QIDQ3056409FDOQ3056409

Authors: G. Tinaztepe, Ramazan Tinaztepe, Gabil R. Adilov 

Publication date: 12 November 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160902745341

Recommendations

• Global minimization of increasing positively homogeneous functions over the unit simplex
• Global minimization of increasing positively homogeneous functions with a single constraint
• Global optimization of the difference of affine increasing and positively homogeneous functions
• The modified cutting angle method for 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
• Global minimization of a generalized convex multiplicative function
• On the global minimization of concave functions
• scientific article; zbMATH DE number 4079167
• Minimax and maximin representations of positively homogeneous functions through linear functions
• scientific article; zbMATH DE number 2068056

zbMATH Keywords

unit simplexmin-type functionincreasing positively homogeneous function

Mathematics Subject Classification ID

Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30) Axiomatic and generalized convexity (52A01)

Cites Work

• Abstract convexity and global optimization
• Cutting angle method and a local search
• Cutting angle methods in global optimization
• Global minimization of increasing positively homogeneous functions over the unit simplex
• An exact method for solving the subproblem of the cutting angle method of global optimization.
• Lipschitz programming via increasing convex-along-rays functions^*
• An approach to the subproblem of the cutting angle method of global optimization

Cited In (8)

• Certain inequalities for \(s\)-convex functions via Caputo fractional derivative and Caputo-Fabrizio integral operator
• An extended algorithm for finding global maximizers of IPH functions in a region with unequal constrains
• The modified cutting angle method for global minimization of increasing positively homogeneous functions over the unit simplex
• Minimization of sub-topical functions over a simplex
• Global minimization of increasing positively homogeneous functions with a single constraint
• A class of increasing positively homogeneous functions for which global optimization problem is NP-hard
• Global minimization of increasing positively homogeneous functions over the unit simplex
• \(s\)-convex functions in the third sense

This page was built for publication: On the 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 Q3056409)