基本释义:

非凸规划

网络释义

1)Nonconvex programming,非凸规划

2)Non-convex quadratic programming,非凸二次规划

3)nonconvex quadratic programming,非凸二次规划

4)nonconvex multi-object programming,多目标非凸规划

5)nonlinear convex programming,非线性凸规划

6)Nonconvex Semidefinite Programming,非凸半定规划

用法和例句

A new homotopy method,called boundary moving combined homotopy method,for solving nonconvex programming is given,and the existence and convergence of the homotopy path is proved under some weak conditions.

本文给出了一个新的求解非凸规划问题的同伦方法,称为动边界同伦方程,并在较弱的条件下,证明了同伦路径的存在性和大范围收敛性。

To the nonconvex programming, the article makes it local convexification by introducing a simple penalty function into the obje ctive function, and solves it like solving convex programming.

针对非凸规划 ,本文引进一简单的惩罚函数将其局部凸化 ,然后用凸规划的方法求解。

The present paper deals with the association of the solution and lagrange multiplier of nonconvex programming with quadratic constraint, and it is shown by means of some examples that the association is hardly programmed for general nonconvex programming problems.

讨论二次约束非凸规划问题的解与Lagrange乘子的若干关系,并举例说明对于一般凸规划问题,这种关系不易刻划清楚。

A new deterministic approach is presented for globally solving nonconvex quadratic programming(QP).

对非凸二次规划(QP)问题提出新的确定性全局优化算法,该算法先对目标函数进行分解得到可分的等价问题,再根据相应函数的线性下估计建立原非凸二次规划的线性松弛规划,同时在分枝定界方法中使用区域删减准则来加速算法的收敛性。

The paper presents a branch and reduce approach for solving nonconvex quadratic programming problems with quadratic constraints, which organically combines outer approximation method with branch and bound scheme.

在这篇论文里,有机地把外逼近方法与分枝定界技术结合起来,提出了解带有二次约束非凸二次规划问题的一个分枝缩减方法;给出了原问题的一个新的线性规划松弛,以便确定它在超矩形上全局最优值的一个下界;利用超矩形的一个深度二级剖分方法,以及超矩形的缩减和删除技术,提高算法的收敛速度;证明了在知道原问题可行点的条件下,该算法在有限步里就可以获得原问题的一个全局最优化解,并且用一个例子说明了该算法是有效的。

Based on brief review of the numerical methods for nonlinear convex programming, an entropy method for solving nonlinear convex programming is proposed.

提出了求解非线性凸规划的熵函数法。

Optimality Conditions for Nonconvex Semidefinite Programming and Augmented Lagrangian Method;

非凸半定规划最优性条件与增广Lagrange方法

A Method To Construct a Quasi-normal Cone for a Class of Complexity Nonconvex Sets and Its Applications in Solving Noncovex Programming

一类复杂非凸区域的拟法锥构造方法及其在非凸规划求解中的应用

Convergence Theorems of Homotopy Method for Constrained Nonconvex Programming

解约束非凸规划问题的同伦方法的收敛性定理(英文)

Approximate Solutions Based on SDP Relaxation of D.C.Decompositions for a Class of Nonconvex QCQP Problems

基于DC分解的非凸二次规划SDP近似解

A Nonlinear Lagrange Method for Solving Nonconvex Semidefinite Programming Problems;

求解非凸半定规划问题的一种非线性Lagrange方法

Nonlinear Rescaling Methods for Nonconvex Second-Order Cone Programming Problems

非凸二阶锥规划问题的非线性重新尺度化方法

A Class of Nonlinear Lagrange Methods for Solving Nonconvex Semidefinite Programming

求解非凸半定规划的一类非线性Lagrange方法

Further Discussions on an Interior-Point Method with Double Slack Vectors for Nonconvex Nonlinear Programming

非凸非线性规划双松弛内点方法的进一步研究

Optimality Conditions for a Class of Nonconvex Nonsmooth Multiobjective Fractional Programming

一类非凸非光滑多目标分式规划的最优性条件

Optimality Conditions for a Class of Nonconvex Nonlinear Fractional Programming

一类非凸非线性分式规划的最优性条件

Optimality Conditions for Nonconvex Semidefinite Programming and Augmented Lagrangian Method;

非凸半定规划最优性条件与增广Lagrange方法

A Convex Filled Function Method for Nonlinear Integer Programming

非线性整数规划的一种凸填充函数方法

Optimality conditions for a class of nonsmooth generalized convex multiobjective programming

一类非光滑广义凸多目标规划的最优性条件

A Class of Lipschitz B-(p,r)-Invex Functions and Nonsmooth Programming

一类LipSchitz B-(p,r)-不变凸函数与非光滑规划(英文)

A New Accelerating Method for the Global Non-convex Quadratic Optimization with Non-convex Quadratic Constraints

一种新的求解带有非凸二次约束的非凸二次规划问题的加速全局优化方法

E-Convex Sets, E-Convex Functions and E-Convex Programming in Linear Spaces;

序线性空间中E-凸集，E-凸函数，E-凸规划

WEAK GENERALIZED LAGRANGE SADDLE POINT FOR THE NONSMOOTH MULTIPLE OBJECTIVE FRACTIONAL PROGRAMMING WITH G-(F,ρ) CONVEXITY;

G-(F,ρ)凸性下的非光滑多目标分式规划弱广义Lagrange鞍点

Optimality criteria for a class of generalized fractional programming under nonsmooth(F,ρ,θ)-d-univexity

非光滑(F,ρ,θ)-d一致不变凸广义分式规划的最优性条件

An Optimal D.C. Decomposition Algorithm for Quadratic Program with a Single Quadratic Constraint

基于最优D.C.分解的单二次约束非凸二次规划精确算法