检索结果-内蒙古大学图书馆

piecewise convex maximization Problems: Piece Adding Technique

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2011年第3期148卷 471-487页

作者： Fortin, Dominique Tseveendorj, Ider Univ Versailles St Quentin Yvelines Lab PRiSM F-78035 Versailles France INRIA F-78153 Le Chesnay France

In this article, we provide a global search algorithm for maximizing a piecewise convex function F over a compact D. We propose to iteratively refine the function F at local solution y by a virtual cutting function p (y) (a <...) and to solve max {min {F(x)-F(y),p (y) (x)}a xaD} pound instead. We call this function either a patch, when it avoids returning back to the same local solutions, or a pseudo patch, when it possibly yields a better point. It is virtual in the sense that the role of cutting constraints is played by additional convex pieces in the objective function. We report some computational results, that represent an improvement on previous linearization based techniques.

关键词： Global search algorithm Local search algorithm Nonconvex optimization convex maximization piecewise convex maximization

来源：评论

学校读者我要写书评

暂无评论

Attractive force search algorithm for piecewise convex maximization problems

引用

OPTIMIZATION LETTERS 2012年第7期6卷 1317-1333页

作者： Fortin, Dominique Tseveendorj, Ider Univ Versailles Lab PRiSM F-78035 Versailles France INRIA F-78153 Le Chesnay France

We consider mathematical programming problems with the so-called piecewise convex objective functions. A solution method for this interesting and important class of nonconvex problems is presented. This method is based on Newton's law of universal gravitation, multicriteria optimization and Helly's theorem on convex bodies. Numerical experiments using well known classes of test problems on piecewise convex maximization, convex maximization as well as the maximum clique problem show the efficiency of the approach.

关键词： Global search algorithm Local search algorithm Nonconvex optimization convex maximization piecewise convex maximization

来源：评论

学校读者我要写书评

暂无评论

Piece adding technique for convex maximization problems

引用

JOURNAL OF GLOBAL OPTIMIZATION 2010年第4期48卷 583-593页

作者： Fortin, Dominique Tseveendorj, Ider Univ Versailles Lab PRiSM F-78035 Versailles France INRIA F-78153 Le Chesnay France

In this article we provide an algorithm, where to escape from a local maximum y of convex function f over D, we (locally) solve piecewise convex maximization max{min{f (x) - f (y), p (y) (x)} | x is an element of D} with an additional convex function p (y) (center dot). The last problem can be seen as a strictly convex improvement of the standard cutting plane technique for convex maximization. We report some computational results, that show the algorithm efficiency.

关键词： Global search algorithm Local search algorithm Nonconvex optimization convex maximization piecewise convex maximization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：