版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Inst Math Hanoi 10000 Vietnam
出 版 物:《SIAM JOURNAL ON OPTIMIZATION》 (工业与应用数学会最优化杂志)
年 卷 期:2000年第11卷第2期
页 面:464-494页
核心收录:
学科分类:07[理学] 070104[理学-应用数学] 0701[理学-数学]
主 题:monotonicity global optimization increasing functions normal sets polyblock approximation algorithms difference of increasing functions multiplicative programming polynomial programming nonconvex quadratic programming distance geometry
摘 要:Problems of maximizing or minimizing monotonic functions of n variables under monotonic constraints are discussed. A general framework for monotonic optimization is presented in which a key role is given to a property analogous to the separation property of convex sets. The approach is applicable to a wide class of optimization problems, including optimization problems dealing with functions representable as differences of increasing functions (d.i. functions).