1.
A branch and bound algorithm for a kind of indefinite quadratic programming
一类不定二次规划问题的分枝定界法
2.
Optimal Solutions and Solving Algorithms for the Indefinite Quadratic Programs;
不定二次规划的最优解集与求解算法
3.
Algorithmic Studies on Continuous and Discrete Monotone Optimization and Indefinite Quadratic Programming;
连续与离散单调优化和不定二次规划算法研究
4.
New branch-and-bound algorithm for indefinite quadratic programming problems
求不定二次规划问题全局解的新的分支定界算法
5.
1. A tight semidefinite relaxation of the quadratically constrained quadratic -11 optimization problem is obtained, which improves several previous SDP relaxations in the literature.
1．提出了{-1，1}二次约束二次整数规划的强化半定规划松弛模型。
6.
The Research on Positive Definite Property of B_κ in Sequential Quadratic Programming;
序列二次规划中B_κ的正定性研究
7.
Method of uncertain multi-attribute decision-making based on quadratic programming and relative superiority degree;
基于二次规划与相对优势度的不确定多属性决策法
8.
A Modified BFGS Method Uses in an SQP Algorithm;
序列二次规划中迭代矩阵的正定性研究
9.
Numerical Methods for Inverse Semi-definite Quadratic Programming Problems
求解半定约束二次规划逆问题的数值方法
10.
Applying Infeasible Interior Point Method to SQP for Constrained Nonlinear Programming
求解约束非线性规划问题的不可行内点序列二次规划方法
11.
An Infeasible Interior Point Algorithm for Convex Quadratic Programming Based on Logarithmic Transformation;
基于对数变换的凸二次规划不可行内点算法
12.
Sequential Quadratic Programming Methods for Nonlinear Semi-infinite Programming;
求解非线性半无限规划的序列二次规划方法
13.
Under mild assumptions on the inexactness, we can find an e-approximate solution of the SOCP by using this algorithm.
在相对不精确的假设下，利用该算法可找到二次锥规划的ε-近似解。
14.
A primal-dual inexact infeasible interior-point algorithm for the second-order cone program (SOCP) was presented.
给出了二次锥规划的一种非精确不可行内点算法。
15.
The New World: The Second Planning Promoting Real Estate Quality
新世界:二次规划提升区域地产品质
16.
Study on the Algorithms and Applications of the Binary Quadratic Programming;
{-1，1}二次规划算法及其应用研究
17.
Numerical Comparisons of Methods for a Type of Inverse Quadratic Programming Problems;
一类二次规划反问题解法的数值比较
18.
Algorithms for Solving Convex Quadratic Programming with Box Constraints;
框式约束凸二次规划问题的内点算法