带有极值函数的多目标双层规划问题的对偶

For a multiobjective bilevel programming problem(P) with an extremal-value function,its dual problem is constructed by using the Fenchel-Moreau conjugate of the functions involved.Under some convexity and monotonicity assumptions,the weak and strong duality assertions are obtained.     

Higher-order Mond-Weir converse duality in multiobjective programming involving cones

In this work,we established a converse duality theorem for higher-order Mond-Weir type multiobjective programming involving cones.This flls some gap in recently work of Kim et al.[Kim D S,Kang H S,Lee Y J,et al.Higher order duality in multiobjective programming with cone constraints.Optimization,2010,59:29–43].     

Nondifferentiable Multiobjective Programming under Generalized d-ρ-(η,θ)-Type I Univexity

In this paper,on the basis of notions of d-ρ-(η,θ)-invex function,type I function and univex function,we present new classes of generalized d-ρ-(η,θ)-type I univex functions.By using these new concepts,we obtain several sufficient optimality conditions for a feasible solution to be an efficient solution,and derive some Mond-Weir type duality results.     

二阶($F, \alpha,\rho, d,p$) 一致凸性与极小极大分式规划的对偶

In this paper,we introduce a class of generalized second order(F,α,ρ,d,p)-univex functions.Two types of second order dual models are considered for a minimax fractional programming problem and the duality results are established by using the assumptions on the functions involved.     

广义 $d$-$\rho$-$(\eta,\theta)$-type I 一致凸非可微多目标规划

In this puper, on the basis of notions of d-p-（η, θ）-invex function, type I function and univex function, we present new classes of generalized d-p-（η, θ）-type I univex functions. By using these new concepts, we obtain several sufficient optimality conditions for a feasible solution to be an efficient solution, and derive some Mond-Weir type duality results.     

Generalized multiobjective symmetric duality under second-order (F, α, ρ, d)-convexity

In this paper, we first formulate a second-order multiobjective symmetric primal-dual pair over arbitrary cones by introducing two different functions f : Rn × Rm → Rk and g : Rn × Rm → Rl in each k-objectives as well as l-constraints. Further, appropriate duality relations are established under second-order(F, α, ρ, d)-convexity assumptions. A nontrivial example which is second-order(F, α, ρ, d)-convex but not secondorder convex/F-convex is also illustrated. Moreover, a second-order minimax mixed integer dual programs is formulated and a duality theorem is established using second-order(F, α, ρ, d)-convexity assumptions. A self duality theorem is also obtained by assuming the functions involved to be skew-symmetric.     

The discrete logarithm problem from a local duality perspective

The discrete logarithm problem is analyzed from the perspective of Tate local duality. Local duality in the multiplicative case and the case of Jacobians of curves over p-adic local fields are considered. When the local field contains the necessary roots of unity, the case of curves over local fields is polynomial time reducible to the multiplicative case, and the multiplicative case is polynomial time equivalent to computing discrete logarithm in finite fields. When the local field does not contains the necessary roots of unity, similar results can be obtained at the cost of going to an extension that contains these roots of unity. There was evidence in the analysis that suggests that the minimal extension where the local duality can be rationally and algorithmically defined must contain the roots of unity. Therefore, the discrete logarithm problem appears to be well protected against an attack using local duality. These results are also of independent interest for algorithmic study of arithmetic duality as they explicitly relate local duality in the case of curves over local fields to the multiplicative case and Tate-Lichtenbaum pairing (over finite fields).     

An Example Using Improved Lefschetz Duality

A theorem of Lambrechts and Stanley is used to find the rational cohomology of the complement of an embedding S~(4n-1)→ S~(2n)× S~m as a module and demonstrate that it is not necessarily determined by the map induced on cohomology by the embedding, nor is it a trivial extension. This demonstrates that the theorem is an improvement on the classical Lefschetz duality.     

Higher-Order $(F,\alpha, \beta, \rho, d, E) $-Convexity in Fractional Programming

In this paper we define higher order $(F,\alpha, \beta, \rho,d, E)$-convex function with respect to $E$-differentiable function $K$ and obtain optimality conditions for nonlinear programming problem (NP) from the concept of higher order $(F,\alpha, \beta, \rho,d)$-convexity. Here, we establish Mond-Weir and Wolfe duality for (NP) and utilize these duality in nonlinear fractional programming problem.     

Global optimization method for linear multiplicative programming

In this paper, a new global algorithm is presented to globally solve the linear multiplicative programming(LMP). The problem(LMP) is firstly converted into an equivalent programming problem(LMP(H))by introducing p auxiliary variables. Then by exploiting structure of(LMP(H)), a linear relaxation programming(LP(H)) of(LMP(H)) is obtained with a problem(LMP) reduced to a sequence of linear programming problems. The algorithm is used to compute the lower bounds called the branch and bound search by solving linear relaxation programming problems(LP(H)). The proposed algorithm is proven that it is convergent to the global minimum through the solutions of a series of linear programming problems. Some examples are given to illustrate the feasibility of the proposed algorithm.     

余弦算子函数共轭性的一些结果

本文系统的给出余弦算子函数的共轭性理论，并引入了余弦函数的θ-自反概念，及给出了一些基本特征     

约束向量优化问题的Fenchel-Lagrange对偶及鞍点

The aim of this paper is to apply a perturbation approach to deal with Fenchel- Lagrange duality based on weak efficiency to a constrained vector optimization problem. Under the stability criterion, some relationships between the solutions of primal problem and the Fenchel-Lagrange duality are discussed. Moreover, under the same condition, two saddle-points theorems are proved.     

向量优化问题的对偶性(英文)

Duality framework on vector optimization problems in a locally convex topological vector space are established by using scalarization with a cone-strongly increasing function.The dualities for the scalar convex composed optimization problems and for general vector optimization problems are studied.A general approach for studying duality in vector optimization problems is presented.     

The Stable Farkas Lemma for composite convex functions in infinite dimensional spaces

In this paper, we consider a general composite convex optimization problem with a cone-convex system in locally convex Hausdorff topological vector spaces. Some Fenchel conjugate transforms for the composite convex functions are derived to obtain the equivalent condition of the Stable Farkas Lemma, which is formulated by using the epigraph of the conjugates for the convex functions involved and turns out to be weaker than the classic Slater condition. Moreover, we get some necessary and sufficient conditions for stable duality results of the composite convex functions and present an example to illustrate that the monotonic increasing property of the outer convex function in the objective function is essential. Our main results in this paper develop some recently results.     

A Sort of Gray-scale Morphological Dilations and Erosions

We introduce first a sort of gray-scale morphological dilations and erosions, which might have some further applications in image analysis. Then we show that the dilation and the erosion defined here form adjunctive pairs. The duality between the dilation and the erosion and some other properties, such as the commuting property with translation and homothety, of these operators are discussed as well.     

Banach空间无限族渐近非扩张映象黏性逼近法

In the framework of reflexive Banach spaces satisfying a weakly continuous duality map, the author uses the viscosity approximation method to obtain the strong convergence theorem for iterations with infinitely many asymptotically nonexpansive mappings. The main results obtained in this paper improve and extend some recent results.     

LTV度量反馈控制问题的最优控制器

In this paper,we consider the measurement feedback control problem for discrete linear time-varying systems within the framework of nest algebra consisting of causal and bounded linear operators.Based on the inner-outer factorization of operators,we reduce the control problem to a distance from a certain operator to a special subspace of a nest algebra and show the existence of the optimal LTV controller in two different ways：one via the characteristic of the subspace in question directly,the other via the duality theory.The latter also gives a new formula for computing the optimal cost.     

The l-adic Dualizing Complex on an Excellent Surface with Rational Singularities

In this article,we show that if X is an excellent surface with rational singularities,the constant sheaf Qe is a dualizing complex.In coefficient Ze,we also prove that the obstruction for Ze to become a dualizing complex,lies on the divisor class groups at singular points.As applications,we study the perverse sheaves and the weights of-adic cohomology groups on such surfaces.     

(V,ρ)h,φ-Ⅰ 型多目标规划的最优性充分条件（英文）

New classes of functions namely （V, ρ）_h,φ-type I, quasi （V, ρ）_h,φ-type I and pseudo （V, ρ）_h,φ-type I functions are defined for multiobjective programming problem by using BenTal’s generalized algebraic operation. The examples of （V, ρ）_h,φ-type I functions are given. The sufficient optimality conditions are obtained for multi-objective programming problem involving above new generalized convexity.     

A PRIMAL-DUAL INTERIOR POINT METHOD FOR PARAMETRIC SEMIDEFINITE PROGRAMMING PROBLEMS

1.IntroductionSemidefiniteprogrammingunifiesquiteanumberofstandardmathematicalprogrammingproblems,suchaslinearprogrammingproblems,quadraticminimizationproblemswithconvexquadraticconstraints.Italsofindsmanyapplicationsinengineering,control,andcombinatorialoptimization[l,2].Inthepastfewyears,aquitenumberofresearchworkbasedoninteriorpointmethodsgaveattentiontoparametricsemidefiniteprogrammingproblems[3,4]fwherediscussionsaremostlyrelatedtopostoptimalandparametricanalysis.Inthispapergwefocusoureff…