On the global minimization of increasing positively homogeneous functions over the unit simplex
From MaRDI portal
Publication:3056409
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
Cites work
- Abstract convexity and global optimization
- An approach to the subproblem of the cutting angle method of global optimization
- An exact method for solving the subproblem of the cutting angle method of 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
- Lipschitz programming via increasing convex-along-rays functions*
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)