Bilevel convex programming models

Bilevel convex models are studied after being cast into a parametric programming form. This form has a lexicographic inner-outer structure where the optimal value of the outer model is optimized on the set of optimal solutions of the inner model. Optimal solutions are characterized using a Lagrangian saddle-point approach and a marginal value formula is given for the outer model. These are used to formulate a general method for finding an optimal solution by input optimization.     

Convergence results for a self-dual regularization of convex problems

We study a one-parameter regularization technique for convex optimization problems whose main feature is self-duality with respect to the Legendre–Fenchel conjugation. The self-dual technique, introduced by Goebel, can be defined for both convex and saddle functions. When applied to the latter, we show that if a saddle function has at least one saddle point, then the sequence of saddle points of the regularized saddle functions converges to the saddle point of minimal norm of the original one. For convex problems with inequality and state constraints, we apply the regularization directly on the objective and constraint functions, and show that, under suitable conditions, the associated Lagrangians of the regularized problem hypo/epi-converge to the original Lagrangian, and that the associated value functions also epi-converge to the original one. Finally, we find explicit conditions ensuring that the regularized sequence satisfies Slater's condition.     

基于随机微分博弈的动态投入产出问题研究

基于W Leontief提出的动态投入产出模型,讨论了考虑随机因素的离散时间下的最优策略设计问题.利用博弈论的思想,把动态投入产出系统抽象为离散时间的博弈模型,运用鞍点均衡策略设计出求解该投入产出问题的新方法,为宏观经济决策提供依据.     

一类二层凸规划的分解法

研究了一类二层凸规划和与之相应的凸规划问题的等价性．并讨论了这类凸规划的对偶性和鞍点问题,最后给出了求解这类二层凸规划的一个分解法．     

一类三次系统的细奇点

本文研究了具有一个高阶奇点的系统（１,２）,通过在实系统中引入奇点量的概念使焦点量和鞍点量得到统一,并且计算了系统（１．２）的各阶奇点量,证明了这样的系统存在珐多三阶细奇点,而且同时存在细奇点的最大个数是四。当系统是四个细奇点时,它们可能是四个一阶细奇点或四个三阶细奇点。     

Loose saddle points of set-valued maps in topological vector spaces

We give a new existence theorem for loose saddle point of set-valued map having values in a partially ordered topological vector space which is based on continuity and quasiconvexity- quasiconcavity of its scalarized maps. Moreover, we prove a new saddle point theorem for vector-valued functions in locally convex topological vector spaces under weak condition that is the semicontinuity of two function scalarization.     

Generalized G-KKM Theorems in Generalized Convex Spaces and Their Applications

Some new generalized G-KKM and generalized S-KKM theorems are proved under the noncompact setting of generalized convex spaces. As applications, some new minimax inequalities, saddle point theorems, a coincidence theorem, and a fixed point theorem are given in generalized convex spaces. These theorems improve and generalize many important known results in recent literature.     

Hölder Continuity of the Saddle Point Set for Real-Valued Functions

This paper is concerned with Hölder continuity of the solution to a saddle point problem. Some new su?cient conditions for the uniqueness and Hölder continuity of the solution for a perturbed saddle point problem are established. Applications of the result on Hölder continuity of the solution for perturbed constrained optimization problems are presented under mild conditions. Examples are given to illustrate the obtained results.     

Slow Passage through a Saddle-Center Bifurcation

Received September 24, 1998; accepted August 9, 1999