咨询与建议

限定检索结果

文献类型

  • 4 篇 期刊文献

馆藏范围

  • 4 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 4 篇 理学
    • 4 篇 数学
  • 3 篇 管理学
    • 3 篇 管理科学与工程(可...

主题

  • 4 篇 extended cutting...
  • 2 篇 nonsmooth optimi...
  • 2 篇 subgradient
  • 2 篇 outer approximat...
  • 2 篇 convex minlp
  • 1 篇 lifted polyhedra...
  • 1 篇 alpha ecp
  • 1 篇 generalized conv...
  • 1 篇 extended support...
  • 1 篇 mixed-integer pr...
  • 1 篇 90c26
  • 1 篇 inner parallel s...
  • 1 篇 26a27
  • 1 篇 nonsmooth minlp
  • 1 篇 pseudoconvex fun...
  • 1 篇 granularity
  • 1 篇 separable minlp
  • 1 篇 90c56
  • 1 篇 outer approximat...
  • 1 篇 feasible roundin...

机构

  • 1 篇 univ turku dept ...
  • 1 篇 abo akad univ ma...
  • 1 篇 karlsruhe inst t...
  • 1 篇 abo akad univ pr...
  • 1 篇 univ turku dept ...
  • 1 篇 abo akad univ pr...
  • 1 篇 abo akad univ pr...

作者

  • 3 篇 westerlund tapio
  • 2 篇 makela marko m.
  • 2 篇 eronen ville-pek...
  • 1 篇 lundell andreas
  • 1 篇 neumann christop...
  • 1 篇 kronqvist jan
  • 1 篇 stein oliver

语言

  • 4 篇 英文
检索条件"主题词=extended cutting plane algorithm"
4 条 记 录,以下是1-10 订阅
排序:
extended cutting plane method for a class of nonsmooth nonconvex MINLP problems
收藏 引用
OPTIMIZATION 2015年 第3期64卷 641-661页
作者: Eronen, Ville-Pekka Makela, Marko M. Westerlund, Tapio Univ Turku Dept Math & Stat Turku Finland Abo Akad Univ Proc Design & Syst Engn Lab Turku Finland
In this article, a generalization of the ECP algorithm to cover a class of nondifferentiable Mixed-Integer NonLinear Programming problems is studied. In the generalization constraint functions are required to be -pseu... 详细信息
来源: 评论
GENERATING FEASIBLE POINTS FOR MIXED-INTEGER CONVEX OPTIMIZATION PROBLEMS BY INNER PARALLEL CUTS
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2021年 第3期31卷 2396-2428页
作者: Neumann, Christoph Stein, Oliver Karlsruhe Inst Technol KIT Inst Operat Res D-76131 Karlsruhe Germany
In this article we introduce an inner parallel cutting plane method (IPCP) to compute good feasible points along with valid cutting planes for mixed-integer convex optimization problems. The method iteratively generat... 详细信息
来源: 评论
Reformulations for utilizing separability when solving convex MINLP problems
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2018年 第3期71卷 571-592页
作者: Kronqvist, Jan Lundell, Andreas Westerlund, Tapio Abo Akad Univ Proc Design & Syst Engn Turku Finland Abo Akad Univ Math & Stat Turku Finland
Several deterministic methods for convex mixed integer nonlinear programming generate a polyhedral approximation of the feasible region, and utilize this approximation to obtain trial solutions. Such methods are, e.g.... 详细信息
来源: 评论
On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
收藏 引用
OPTIMIZATION 2014年 第7期63卷 1057-1073页
作者: Eronen, Ville-Pekka Makela, Marko M. Westerlund, Tapio Univ Turku Dept Math & Stat FI-20014 Turku Finland Abo Akad Univ Proc Design & Syst Engn Lab FI-20500 Turku Finland
In this article, generalization of some mixed-integer nonlinear programming algorithms to cover convex nonsmooth problems is studied. In the extended cutting plane method, gradients are replaced by the subgradients of... 详细信息
来源: 评论