线性约束三次规划问题的全局最优性必要条件和最优化算法

讨论了带线性不等式约束三次规划问题的最优性条件和最优化算法. 首先, 讨论了带有线性不等式约束三次规划问题的 全局最优性必要条件. 然后, 利用全局最优性必要条件, 设计了解线性约束三次规划问题的一个新的局部最优化算法(强局部最优化算法). 再利用辅助函数和所给出的新的局部最优化算法, 设计了带有线性不等式约束三 规划问题的全局最优化算法. 最后, 数值算例说明给出的最优化算法是可行的、有效的.

Necessary global optimality conditions and optimization methods for cubic polynomial optimization problems with linear constraints

In this paper, the global optimality conditions and optimization methods for cubic polynomial optimization problems with linear inequality constraints are considered. Firstly, we propose a necessary global optimality condition for cubic polynomial optimization problems with linear inequality constraints. Then, a new local optimization method (or called strongly local optimization methods) is presented by using its necessary global optimality conditions. A global optimization method is proposed for cubic polynomial optimization problems with linear inequality constraints by combining the new local optimization methods together with some auxiliary functions. Finally, some numerical examples are given to illustrate that these approaches are efficient.