New variants of the generalized level method for minimization of convex nondifferentiable functions taking infinite values

New variants of the generalized level method for minimization of convex Lipschitz functions on a compact set with a nonempty interior are proposed. These variants include the well-known generalized and classical level methods. For the new variants, an estimate of the convergence rate is found, including the variants in which the auxiliary problems are solved approximately.     

Supercompactness and measurable limits of strong cardinals II: Applications to level by level equivalence

We construct models for the level by level equivalence between strong compactness and supercompactness in which for κ the least supercompact cardinal and δ ≤ κ any cardinal which is either a strong cardinal or a measurable limit of strong cardinals, 2^δ > δ ⁺ and δ is < 2^δ supercompact. In these models, the structure of the class of supercompact cardinals can be arbitrary, and the size of the power set of κ can essentially be made as large as desired. This extends and generalizes [5, Theorem 2] and [4, Theorem 4]. We also sketch how our techniques can be used to establish a weak indestructibility result. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Multisplitting Iteration Schemes for Solving a Class of Nonlinear Complementarity Problems

We consider several synchronous and asynchronous multisplitting iteration schemes for solving aclass of nonlinear complementarity problems with the system matrix being an H-matrix.We establish theconvergence theorems for the schemes.The numerical experiments show that the schemes are efficient forsolving the class of nonlinear complementarity problems.     

Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.     

低温太阳热能与化学链燃烧相结合控制CO2分离动力系统

本文探索并提出控制CO2分离的低温太阳热能与清洁合成燃料甲醇-三氧化二铁化学链燃烧相结合的新颖能源动力系统。基于图象(?)分析方法,明确地指出甲醇化学链燃烧能量释放过程燃烧堋损失减小和低温太阳热能品位提升的机理。从能源有效利用和环境相容出发,研究和揭示化学链燃烧与太阳能有机整合共同减小CO2分离能耗的特性规律。相比不分离常规联合循环,新系统(?)效率提高约6．2个百分点;与分离CO2的联合循环相比,新系统媚效率提高约14．2个百分点。同时,低温太阳热能热转功效率可达到22．5％。     

The Generalized KKM Map and Its Applications to Variational Inequalities

In this paper,applying the concept of generalized KKM map,we study problems ofvariational inequalities.We weaken convexity(concavity)conditions for a functional of two variables■(x,y)in the general variational inequalities.Last,we show a proof of non-topological degree meth-od of acute angle principle about monotone operator as an application of these results.     

Inexact Newton methods for the nonlinear complementarity problem

An exact Newton method for solving a nonlinear complementarity problem consists of solving a sequence of linear complementarity subproblems. For problems of large size, solving the subproblems exactly can be very expensive. In this paper we study inexact Newton methods for solving the nonlinear, complementarity problem. In such an inexact method, the subproblems are solved only up to a certain degree of accuracy. The necessary accuracies that are needed to preserve the nice features of the exact Newton method are established and analyzed. We also discuss some extensions as well as an application. This research was based on work supported by the National Science Foundation under grant ECS-8407240.     

A NUMERICAL EMBEDDING METHOD FOR SOLVING THE NONLINEAR COMPLEMENTARITY PROBLEM(Ⅱ)-ALGORITHM AND ITS CONVERGENCE

In this paper,based on the results presented in part Ⅰ of this paper[18],we present a numerical embedding algorithm for solving the nonlinear complementarityproblem, and prove its convergence carefully. Numerical experiments show that thealgorithm is successful.     

On a Boolean-valued Model of the Strict Implication System(Continuous)

The reference [4] proved the consistency of S1 and S2 among Lewis' five strict implication systems in the modal logic by using the method of the Boolean-valued model. But, in this method, the consistency of S3, S4 and S5 in Lewis' five strict implication systems is not decided. This paper makes use of the properties: (1) the equivalence of the modal systems S3 and P3, S4 and P4; (2) the modal systems P3 and P4 all contained the modal axiom T(□p → p); (3) the modal axiom T is correspondence to the reflexive property in VB. Hence, the paper proves: (a) ‖As31‖ = 1; (b) ‖AS41‖ = 1; (c) ‖AS5l‖ = 1 in the model (where B is a complete Boolean algebra, R is reflexive property in VB). Therefore, the paper finally proves that the Boolean-valued model VB of the ZFC axiom system in set theory is also a Boolean-valued model of Lewis' the strict implication system S3, S4 and S5.     

The Spaces b~p with 0 < p < 1

Let 0 < p < 1. In this paper we prove that the Bergman norm on the p-th Bergman space bp(H) is equivalent to certain "normal direction norm" as well as certain "tangential direction norm", where H = Rn-1 × R is the upper half space. As an application, we get the boundedness of harmonic conjugation operators on bp(H).