一类二层凸规划的对偶二层规划

本文讨论上层目标函数以下层子系统目标函数的最优值作为反馈的一类二层凸规划的对偶规划问题 ,在构成函数满足凸连续可微等条件的假设下 ,建立了二层凸规划的 Lagrange对偶二层规划 ,并证明了基本对偶定理 .     

凸序列不等式的控制证明

利用控制不等式理论简洁地证明了一类凸序列不等式 (包括著名的 Nanson不等式的几个推广 ) ,并给出若干应用 .     

Generalized projection and approximation of fixed points of nonself maps

Let K be a nonempty closed convex proper subset of a real uniformly convex and uniformly smooth Banach space E; T:K→E be an asymptotically weakly suppressive, asymptotically weakly contractive or asymptotically nonextensive map with F(T){xK: Tx=x}≠. Using the notion of generalized projection, iterative methods for approximating fixed points of T are studied. Convergence theorems with estimates of convergence rates are proved. Furthermore, the stability of the methods with respect to perturbations of the operators and with respect to perturbations of the constraint sets are also established.     

A RANDOM FIXED POINT ITERATION FOR THREE RANDOM OPERATORS ON UNIFORMLY CONVEX BANACH SPACES

In the present paper we introduce a random iteration scheme for three random operators defined on a closed and convex subset of a uniformly convex Banach space and prove its convergence to a common fixed point of three random operators. The result is also an extersion of a known theorem in the corresponding non-random case.     

Intersection Cohomology on Nonrational Polytopes⋆

We consider a fan as a ringed space (with finitely many points). We develop the corresponding sheaf theory and functors, such as direct image R_* ( is a subdivision of a fan), Verdier duality, etc. The distinguished sheaf , called the minimal sheaf plays the role of an equivariant intersection cohomology complex on the corresponding toric variety (which exists if is rational). Using we define the intersection cohomology space IH(). It is conjectured that a strictly convex piecewise linear function on acts as a Lefschetz operator on IH(). We show that this conjecture implies Stanley's conjecture on the unimodality of the generalized h-vector of a convex polytope.     

The isometric extension problem in the unit spheres of l<Superscript>p</Superscript>(Г) (<Emphasis Type="Italic">p</Emphasis> >1) type spaces

In this paper, we first derive the representation theorem of onto isometric mappings in the unit spheres of l ^p (Г) (@#@(p >) 1,p ≠ 2 type spaces, and then we conclude that such mappings can be extended to the whole space as real linear isometries by using the previous result of the author.     

A Quasi-Newton Penalty Barrier Method for Convex Minimization Problems

We describe an infeasible interior point algorithm for convex minimization problems. The method uses quasi-Newton techniques for approximating the second derivatives and providing superlinear convergence. We propose a new feasibility control of the iterates by introducing shift variables and by penalizing them in the barrier problem. We prove global convergence under standard conditions on the problem data, without any assumption on the behavior of the algorithm.     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.     

On Duality for a Class of Quasiconcave Multiplicative Programs

Multiplicative programs are a difficult class of nonconvex programs that have received increasing attention because of their many applications. However, given their nonconvex nature, few theoretical results are available. In this paper, we study a particular case of these programs which involves the maximization of a quasiconcave function over a linear constraint set. Using results from conjugate function theory and generalized geometric programming, we derive a complete duality theory. The results are further specialized to linear multiplicative programming.