1.
The Preconditioning of Strict Convex Quadratic Programming;
严格凸二次规划的Cholesky预处理
2.
Algorithms for Solving Convex Quadratic Programming with Box Constraints;
框式约束凸二次规划问题的内点算法
3.
Approximate Solutions Based on SDP Relaxation of D.C.Decompositions for a Class of Nonconvex QCQP Problems
基于DC分解的非凸二次规划SDP近似解
4.
On Mehrotra-Type Predictor-Corrector Algorithm for Convex Quadratic Programming
凸二次规划的一个Mehrotra型预估校正算法
5.
A CONVEX QUADRATIC PROGRAMMING MODEL OF OPTIMAL GNP
关于国民生产总值最优的凸二次规划模型
6.
An Infeasible Interior Point Algorithm for Convex Quadratic Programming Based on Logarithmic Transformation;
基于对数变换的凸二次规划不可行内点算法
7.
An improved interior algorithm for quadratic programs;
求解凸二次规划问题的一个改进内点算法
8.
Improved Primal-dual Feasible Interior Point Algorithm for Convex Quadratic Programming
求解凸二次规划的一种改进的原-对偶内点算法
9.
Conjugate Gradient Algorithm for a Kind of Convex Quadratic Programming under Equality Constraints
一类等式约束下的凸二次规划的共轭梯度算法
10.
A Projection Neural Network for Solving the Degenerate Quadratic Program
一类求解退化凸二次规划的投影神经网络
11.
Primary Numerical Experiment to the Primal-dual Interior Point Algorithm for Convex Quadratic Programming
凸二次规划的原-对偶内点算法数值实验初步
12.
An Optimal D.C. Decomposition Algorithm for Quadratic Program with a Single Quadratic Constraint
基于最优D.C.分解的单二次约束非凸二次规划精确算法
13.
A global optimization algorithm for solving the non-convex quadratic programming problem with quadratic constraint
带有二次约束非凸二次规划问题的一种全局优化方法
14.
A New Accelerating Method for the Global Non-convex Quadratic Optimization with Non-convex Quadratic Constraints
一种新的求解带有非凸二次约束的非凸二次规划问题的加速全局优化方法
15.
A Differential Equation Approach Based on the Space Transformation of Square Function to Convex Quadratic Programming;
基于平方函数空间变换的凸二次规划问题的微分方程方法
16.
Markowitz Capital Investment Combination Model Easy Algorithm Based on Protrusion Analysis;
Markowitz资产投资组合模型的凸二次规划快速求解算法
17.
A wide-neighborhood primal-dual interior-point algorithm based on reduced potential function for convex quadratic programming with box constrains
框式凸二次规划宽邻域原始-对偶势下降内点算法
18.
The optimality conditions of the multi objective programming under generation B-subconvex functions
广义B-次凸多目标规划的最优性条件