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

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

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.     

Minkowski-type and Alexandrov-Type Theorems for Polyhedral Herissons

Classical H. Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H. Minkowski uniqueness theorem due to A.D. Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be described as polyhedra with injective spherical image.     

A new proof for Rockafellar's characterization of maximal monotone operators

We provide a new and short proof for Rockafellar's characterization of maximal monotone operators in reflexive Banach spaces based on S. Fitzpatrick's function and a technique used by R. S. Burachik and B. F. Svaiter for proving their result on the representation of a maximal monotone operator by convex functions.

     

Lattice path combinatorics and asymptotics of multiplicities of weights in tensor powers

We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers V_λ^⊗N of an irreducible representation V_λ of a compact connected Lie group G. The weights are allowed to depend on N, and we obtain several regimes of pointwise asymptotics, ranging from a central limit region to a large deviations region. We use a complex steepest descent method that applies to general asymptotic counting problems for lattice paths with steps in a convex polytope.     

Separating the solution sets of analytical and polynomial systems

A linear inequality system with infinitely many constraints is polynomial (analytical) if its index set is a compact interval of the real line and all its coefficients are polynomial (analytical, respectively) functions of the index on this interval. This paper provides an example of analytical system whose solution set cannot be the solution set of any polynomial system. Research supported by DGES of Spain and FEDER of UE, Grant BFM2002-04114-C02-01. Research supported by CONACyT of Mexico, Grant 130036. Research partially supported by CONACyT of Mexico, Grant 44003.     

集值函数的广义共轭函数和次微分

该文通过推广实函数的凸共轭函数及其次微分的概念,建立了一类关于集值函数的广义共轭函数及其次微分理论——集值函数的(H,Ω)共轭函数及(H,Ω)次微分理论。这一理论可以用来建立非线性规划问题的一类对偶性原理。     

Generalized Equilibrium Problems and Generalized Complementarity Problems

From a general minimax inequality or an abstract lopsided saddle-point theorem, we deduce general Karamardian-type equilibrium theorems and generalized complementarity theorems. Our new results extend a number of well-known earlier works of many authors.     

Contingent epiderivatives and set-valued optimization

In this paper we introduce the concept of the contingent epiderivative for a set-valued map which modifies a notion introduced by Aubin [2] as upper contingent derivative. It is shown that this kind of a derivative has important properties and is one possible generalization of directional derivatives in the single-valued convex case. For optimization problems with a set-valued objective function optimality conditions based on the concept of the contingent epiderivative are proved which are necessary and sufficient under suitable assumptions.