Scholarlink

Convex maximization problem over a polyhedron given by m linear equations is investigated. It has been shown that such a problem of dimension n can be reduced into another optimization problem of dimension \(n-m\) . We provide a global optimality condition that is based on solving the reduced problem. We illustrate the efficiency of the optimality condition on an example.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Dimensionality Reduction for Quadratic Convex Maximization

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Ider Tseveendorj

摘要

Convex maximization problem over a polyhedron given by m linear equations is investigated. It has been shown that such a problem of dimension n can be reduced into another optimization problem of dimension \(n-m\) . We provide a global optimality condition that is based on solving the reduced problem. We illustrate the efficiency of the optimality condition on an example.