首页> 外文会议>Experimental algorithms >Convexity and Optimization of Condense Discrete Functions
【24h】

Convexity and Optimization of Condense Discrete Functions

机译:凝聚离散函数的凸性和优化

获取原文
获取原文并翻译 | 示例

摘要

A function with one integer variable is defined to be integer convex by Fox [3] and Denardo [1] if its second forward differences are positive. In this paper, condense discrete convexity of nonlinear discrete multivariable functions with their corresponding Hessian matrices is introduced which is a generalization of the integer convexity definition of Fox [3] and Denardo [1] to higher dimensional space Z~n. In addition, optimization results are proven for C~ 1 condense discrete convex functions assuming that the given condense discrete convex function is C~1. Yiiceer [17] proves convexity results for a certain class of discrete convex functions and shows that the restriction of the adaptation of Rosen-brook's function from real variables to discrete variables does not yield a discretely convex function. Here it is shown that the adaptation of Rosenbrook's function considered in [17] is a condense discrete convex function where the set of local minimums is also the the set of global minimums.
机译:如果Fox函数[3]和Denardo [1]的第二个正向差为正,则将具有一个整数变量的函数定义为凸整数。本文介绍了将非线性离散多元函数的离散凸凸及其相应的Hessian矩阵压缩的方法,它是将Fox [3]和Denardo [1]的整数凸定义推广到高维空间Z〜n的方法。此外,假设给定的凝聚离散凸函数为C〜1,证明了C〜1凝聚离散凸函数的优化结果。 Yiiceer [17]证明了一类离散凸函数的凸性结果,并表明Rosen-brook函数从实变量到离散变量的适应性约束不会产生离散凸函数。这里显示出[17]中考虑的Rosenbrook函数的适应是一个凝聚的离散凸函数,其中局部最小值的集合也是全局最小值的集合。

著录项

  • 来源
    《Experimental algorithms》|2011年|p.33-42|共10页
  • 会议地点 Kolimpari(GR);Kolimpari(GR)
  • 作者单位

    Department of Mathematics, University of Oklahoma, Norman, OK, 73019, U.S.A. School of Industrial Engineering, University of Oklahoma, Norman, OK, 73019, U.S.A.,School of Industrial Engineering, University of Oklahoma, Norman, OK, 73019, U.S.A.;

    George Mason University, Department of Systems Engineering and Operations Research, Fairfax, Virginia, 22030, U.S.A.;

    School of Industrial Engineering, University of Oklahoma, Norman, OK, 73019, U.S.A.;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 软件工程;
  • 关键词

    integer programming; mathematical programming; discrete convex function; real convex function;

    机译:整数编程数学编程;离散凸函数实凸函数;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号