Minimization of sub-topical functions over a simplex

DOI10.22067/IJNAO.2023.83361.1290MaRDI QIDQ6599939zbMATH OpenFDO

Authors Mohammad Hossein Daryaei, M. A. Yaghoobi

Publication date 6 September 2024

Published in Iranian Journal of Numerical Analysis and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.22067/IJNAO.2023.83361.1290

zbMATH Keywords

abstract convexitycutting angle methodglobal optimizationsub-topical functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

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 over the unit simplex
• An exact method for solving the subproblem of the cutting angle method of global optimization.
• Maximal elements of sub-topical functions with applications to global optimization

Cites work

• Topical and sub-topical functions, downward sets and abstract convexity

This page was built for publication: Minimization of sub-topical functions over a simplex

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