非光滑多目标规划的不动点算法(英)

本文讨论不动点算法在非光滑多目标规划中的应用，得到了一些新的最优性条件以及不动点与非光滑多目标的解之间的关系，并且给出了解非光滑多目标规划的不动点算法的收敛性．     

非光滑多目标规划的不动点算法

本文讨论不动点算法在非光滑多目标规划中的应用，得到了一些新的最优性条件以及不动点与非光滑多目标的解之间的关系，并且给出了解非光滑多目标规划的不动点算法的收敛性。     

不可微规划的极大熵不动点算法

本文将极大熵逼近方法和不动点计算方法有机地结合,提出了一种不可微规划计算方法．该方法同样也适用于求解可微规划,而后给出了该方法的收敛性     

Banach空间中一类广义非扩张映像族公共不动点问题研究

1引言Banach空间中非扩张映像的不动点问题,由于其在变分不等式、优化及参数估计问题、反问题、图像恢复和信号处理等领域中的广泛应用[3,10,13-14],具有相当重要的理论意义和应用价值,一直是诸多学者的关注重点.不动点问题研究,包括不动点的存在判别、不动点集性质研究、不动点构造以及不动点理论在相关领域的应用等.     

g-非扩张型FUZZY映象序列的公共FUZZY混合不动点

提出fuzzy映象序列的公共fuzzy混合不动点的概念，研究了g-非扩张型fuzzy映象序列的公共fuzzy混合不动点定理，我们所得的定理改进和推广了近期相关的重要结果．     

α凸算子(α>1)的正不动点存在性及其应用

通过构造一个特殊的锥,利用锥拉伸与压缩不动点定理对α凸算子(α>1)正不动点的存在性与不可比较性作了研究,并将其结果应用到超线性多项式型Hammerstein积分方程．     

不可微多目标优化

本文首先说明了什么是不呆微多目标优化问题，然后概括性地介绍了多目标优化研究的主要内容，在此基础上，对不可微多目标优化的主要结果和内容加以综述。     

带有非局部条件二阶微分包含的可控性

研究了一类带有非局部条件二阶微分包含的可控性,在多值函数F(t,x)取凸情形下讨论了上述问题,建立了可控性的充分条件.本文将所讨论的问题转化为集值积分算子的不动点问题,利用Kakutani不动点定理得到可控性.     

半无穷区间二阶微分方程边值问题的多个正解的存在性

利用Leggett-Williams不动点定理,研究半无穷区间边值问题的多个正解的存在性．     

非扩张映射粘性逼近的强收敛性

在具有一致Gateaux可微范数的Banach空间中,研究了一个逼近非扩张映射不动点的粘性逼近方法,运用Banach极限推导了该逼近方法收敛的充分条件,并通过对该粘性逼近方法的修正逐步减少了收敛分析中的限制条件.     

Generalized viscosity approximation methods in multiobjective optimization problems

In this paper, we consider an extend-valued nonsmooth multiobjective optimization problem of finding weak Pareto optimal solutions. We propose a class of vector-valued generalized viscosity approximation method for solving the problem. Under some conditions, we prove that any sequence generated by this method converges to a weak Pareto optimal solution of the multiobjective optimization problem.     

多目标优化正则条件的一个注记

给出带不等式约束的非光滑多目标优化问题正则条件的一个例子.通过该例,指出最近由Burachik和Rizvi利用线性化锥提出的可微多目标优化问题的正则条件不能利用Clarke导数推广到非光滑情形.     

Generalized (<Emphasis Type="Italic">F</Emphasis>,<Emphasis Type="Italic">ρ</Emphasis>)-Convexity and Duality in Nonsmooth Problems of Multiobjective Optimization

A mixed-type dual for a nonsmooth multiobjective optimization problem with inequality and equality constraints is formulated. We obtain weak and strong duality theorems for a mixed-type dual without requiring the regularity assumptions and the nonnegativeness of the Lagrange multipliers associated to the equality constraints. We apply also a nonsmooth constraint qualification for multiobjective programming to establish strong duality results. In this case, our constraint qualification assures the existence of positive Lagrange multipliers associated with the vector-valued objective function. This work was supported by Center of Excellence for Mathematics, University of Isfahan, Isfahan, Iran.     

非光滑多目标广义本性凸规划的最优性条件与对偶

In this paper, we introduce generalized essentially pseudoconvex function and generalized essentially quasiconvex function, and give sufficient optimality conditions of the nonsmooth generalized convex multi-objective programming and its saddle point theorem about cone efficient solution. We set up Mond-Weir type duality and Craven type duality for nonsmooth multiobjective programming with generalized essentially convex functions, and prove them.     

非光滑非凸多目标规划解的充分条件

Kuhn-Tucker型条件的充分性一直是最优化理论中引人注意的一个问题.本文对非光滑函数提出了几个非凸概念,然后,讨论了非光滑非凸多目标规划中Kuhn-Tucker型条件和Fritz John型条件的充分性,在很弱的条件下,建立了一系列充分条件.     

Necessary Optimality Conditions and a New Approach to Multiobjective Bilevel Optimization Problems

Multiobjective optimization problems typically have conflicting objectives, and a gain in one objective very often is an expense in another. Using the concept of Pareto optimality, we investigate a multiobjective bilevel optimization problem (say, P). Our approach consists of proving that P is locally equivalent to a single level optimization problem, where the nonsmooth Mangasarian–Fromovitz constraint qualification may hold at any feasible solution. With the help of a special scalarization function introduced in optimization by Hiriart–Urruty, we convert our single level optimization problem into another problem and give necessary optimality conditions for the initial multiobjective bilevel optimization problem P.     

Nonsmooth multiobjective optimization using limiting subdifferentials

In this study, using the properties of limiting subdifferentials in nonsmooth analysis and regarding a separation theorem, some weak Pareto-optimality (necessary and sufficient) conditions for nonsmooth multiobjective optimization problems are proved.     

New Optimality Conditions for the Semivectorial Bilevel Optimization Problem

The paper is concerned with the optimistic formulation of a bilevel optimization problem with multiobjective lower-level problem. Considering the scalarization approach for the multiobjective program, we transform our problem into a scalar-objective optimization problem with inequality constraints by means of the well-known optimal value reformulation. Completely detailed first-order necessary optimality conditions are then derived in the smooth and nonsmooth settings while using the generalized differentiation calculus of Mordukhovich. Our approach is different from the one previously used in the literature and the conditions obtained are new. Furthermore, they reduce to those of a usual bilevel program, if the lower-level objective function becomes single-valued.