1.
Multiobjective Programming under S-d-invexity and E-Convex Programming;
S-d-invexity条件下的多目标规划和凸规划问题
2.
Mond-Weir DUALITY FOR PROGRAMMING PROBLEMS WITH B-(p,r)-INVEXITY FUNCTIONS;
B-(p,r)-不变凸规划问题的Mond-Weir型对偶
3.
Investigation on Neural Network Theory Related to Convex Optimization Problem;
与凸规划问题相关的神经网络理论的研究
4.
Convergence Theorems of Homotopy Method for Constrained Nonconvex Programming
解约束非凸规划问题的同伦方法的收敛性定理(英文)
5.
Algorithms for Solving Convex Quadratic Programming with Box Constraints;
框式约束凸二次规划问题的内点算法
6.
A Nonlinear Lagrange Method for Solving Nonconvex Semidefinite Programming Problems;
求解非凸半定规划问题的一种非线性Lagrange方法
7.
An improved interior algorithm for quadratic programs;
求解凸二次规划问题的一个改进内点算法
8.
Convex Quality and Continuity of Double-Layer Program in Banach Space;
Banach空间中二层规划的凸性和连续性问题
9.
Nonlinear Rescaling Methods for Nonconvex Second-Order Cone Programming Problems
非凸二阶锥规划问题的非线性重新尺度化方法
10.
ε-Optimality conditions for a class of fractional semi-infinite programming with(F,α,ε)-convex functions
(F,α,ε)-凸分式半无限规划问题的ε-最优性条件
11.
A Differential Equation Approach Based on the Space Transformation of Square Function to Convex Quadratic Programming;
基于平方函数空间变换的凸二次规划问题的微分方程方法
12.
Effciency Conditions and Duality for a Class of Multiobjective Fractional Programming Problems;
一类广义凸多目标分式规划问题的有效性条件及对偶
13.
Some Theories for the Generalized Convexity Programming and Algoeithm Research of Constrained Linear Complementrity;
关于广义凸规划和约束线性互补问题的若干理论及算法研究
14.
Optimality Condition and Duality Results for a Class of Multi-objective Fractional Programming Problems with Generalized Convexity;
广义凸性条件下一类多目标分式规划问题的最优性条件和对偶
15.
Optimality conditions for generalized K-(F,a,p,d)convex semi-infinite programming problem;
一类广义K-(F,a,ρ,d)-凸半无限规划问题的最优性条件
16.
THE DUALITY OF MULTI-OBJECTIVE PROGRAMMING INVOLVING GENERALIZED (F,α,ρ,d)-CONVEXITY;
广义(F,α,ρ,d)-凸性下一类多目标规划问题的对偶
17.
K-T conditions and duality for multiobjective fractional programming under generalized(F,α,ρ,d)-convex;
广义(F,α,ρ,d)-凸性条件下多目标分式规划问题的K-T条件及对偶
18.
APPLICATION OF THE PARALLELIZATION TECHNIQUE TO A DUAL METHOD FOR A CONSTRAINED CONVEX PROGRAMMING PROBLEM;
并行技术在约束凸规划化问题的对偶算法中的应用