Abstract
Abstract
A concept of a point-dependent Lipschitz constant is suggested. This concept is combined with Piyavskii’s algorithm. Technical details of constructing the point-dependent Lipschitz constant are described. Preliminary examples showing the effectiveness of the introduced concept are given.
Reference12 articles.
1. Multiplicative programming problems: analysis and efficient point search heuristic;Benson;Journal of Optimization Theory and Applications,1997
2. Global maximization of a generalized concave multiplicative function;Benson;Journal of Optimization Theory and Applications,2008
3. Lipschitz optimization;Hansen;Handbook of global optimization. Nonconvex optimization and its applications,1995
4. Multiplicative programming problems;Konno;Handbook of global optimization. Nonconvex optimization and its applications,1995