The problem of D-pseudoconvex programming with operator con-straints is discussed in this paper.Some new optimality conditions are presentedand an error made by V.Barbu in [4] is pointed out.
The purpose of this paper is threefold.(i) To explain the effective Kohn algorithm for multipliers in the complex Neumann problem and its difference with the full-real-radical Kohn algorithm, especially in the context...The purpose of this paper is threefold.(i) To explain the effective Kohn algorithm for multipliers in the complex Neumann problem and its difference with the full-real-radical Kohn algorithm, especially in the context of an example of Catlin-D'Angelo concerning the ineffectiveness of the latter.(ii) To extend the techniques of multiplier ideal sheaves for the complex Neumann problem to general systems of partial differential equations.(iii) To present a new procedure of generation of multipliers in the complex Neumann problem as a special case of the multiplier ideal sheaves techniques for general systems of partial differential equations.展开更多
基金supported by National Natural Science Foundation of China
文摘The problem of D-pseudoconvex programming with operator con-straints is discussed in this paper.Some new optimality conditions are presentedand an error made by V.Barbu in [4] is pointed out.
文摘The purpose of this paper is threefold.(i) To explain the effective Kohn algorithm for multipliers in the complex Neumann problem and its difference with the full-real-radical Kohn algorithm, especially in the context of an example of Catlin-D'Angelo concerning the ineffectiveness of the latter.(ii) To extend the techniques of multiplier ideal sheaves for the complex Neumann problem to general systems of partial differential equations.(iii) To present a new procedure of generation of multipliers in the complex Neumann problem as a special case of the multiplier ideal sheaves techniques for general systems of partial differential equations.
