convex programming

Interior point algorithm of convex programming with simple constraints;

简单约束凸规划的一种内点算法

Convergence of maxnnum entropy method for solving constrained convex programming;

一般约束凸规划极大熵方法的收敛性

In this paper, we discuss a class of nonsmooth convex program , give the relations between the existence of the Lagrange multiplier and the subdifferentiability of the value functio; also , present the sufficient con- ditions for the exiatence of the multiplier.

本文讨论了一类非光滑凸规划问题，给出了Ｌａｇｒａｎｇｅ乘子的存在性与值函数的次可微性的关系和乘子存在的充分条件。

And a counter example about a result of E-convex programming is given.

给出了一类广义的凸集和凸函数——E-凸集和E-凸函数的一个性质;并给出了关于E-凸规划命题的一个反例。

The definition of B-vex programming is proposed and its basic properties are obtained.

通过给出B－凸规划的定义并研究它的基本性质，得到B－凸规划的最优性条件。

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乘子的若干关系,并举例说明对于一般凸规划问题,这种关系不易刻划清楚。

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

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

Multiobjective Programming under S-d-invexity and E-Convex Programming;

S-d-invexity条件下的多目标规划和凸规划问题

Mond-Weir DUALITY FOR PROGRAMMING PROBLEMS WITH B-(p,r)-INVEXITY FUNCTIONS;

B-(p,r)-不变凸规划问题的Mond-Weir型对偶

A THEOREM OF THE ALTERNATIVE AND ITS APPLICATION TO THE GENERAL CONVEX PROGRAMMING;

一个择一定理及对广义凸规划的应用

Primal-dual Affine Scaling Algorithm for a Convex Programming with Box Constraints;

框式凸规划的原—对偶仿射尺度算法

This paper presents an interior trust region method for linear constrained LC^1 convex optimization problems.

本文提出一种解线性约束凸规划的数值方法。

MC Methods for a Class of Stochastic Convex Programming and Its Applications to Finance;

解一类随机凸规划的MC方法及在金融中的应用

Fuzzy Convex Analysis and Its Applications to Fuzzy Programming;

模糊凸分析及其在模糊规划中的应用

Algorithms for Solving Convex Quadratic Programming with Box Constraints;

框式约束凸二次规划问题的内点算法

The Preconditioning of Strict Convex Quadratic Programming;

严格凸二次规划的Cholesky预处理

On Multi-purposefully programmed Wolf Duality Featured with Vector Convexity;

具有向量凸性的多目标规划的Wolf对偶

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

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

ε-Optimality Conditions for a Class of Fractional Semi-Infinite Programming with B_ε-Invex Functions

B_ε-不变凸分式半无限规划的ε-最优性

On Mehrotra-Type Predictor-Corrector Algorithm for Convex Quadratic Programming

凸二次规划的一个Mehrotra型预估校正算法

Solving a Class of Convex Stochastic Programs Via Monte Carlo Simulation

求解凸随机规划的Monte Carlo模拟方法(英文)

B-Semi-(E,F)-Convex Functions and Programming

B-半-(E,F)-凸函数和规划(英文)

The optimality conditions of the multi objective programming under generation B-subconvex functions

广义B-次凸多目标规划的最优性条件

Optimality of Multiple-objective Programming with V_ρ-I Type Invex Function

V_ρ-I型不变凸多目标规划的最优性