Partially Strictly Monotone and Nonlinear Penalty Functions for Constrained Mathematical Programs

We introduce the concept of partially strictly monotone functions and apply it to construct a class of nonlinear penalty functions for a constrained optimization problem. This class of nonlinear penalty functions includes some (nonlinear) penalty functions currently used in the literature as special cases. Assuming that the perturbation function is lower semi-continuous, we prove that the sequence of optimal values of nonlinear penalty problems converges to that of the original constrained optimization problem. First-order and second-order necessary optimality conditions of nonlinear penalty problems are derived by converting the optimality of penalty problems into that of a smooth constrained vector optimization problem. This approach allows for a concise derivation of optimality conditions of nonlinear penalty problems. Finally, we prove that each limit point of the second-order stationary points of the nonlinear penalty problems is a second-order stationary point of the original constrained optimization problem.     

Non-compact generalized variational inequalities for quasi-monotone and hemi-continuous operators with applications

Some results are obtained for non-compact cases in topological vector spaces for the existence problem of solutions for some set-valued variational inequalities with quasi-monotone and lower hemi-continuous operators, and with quasi-semi-monotone and upper hemi-continuous operators. Some applications are given in non-reflexive Banach spaces for these existence problems of solutions and for perturbation problems for these set-valued variational inequalities with quasi-monotone and quasi-semi-monotone operators. This revised version was published online in June 2006 with corrections to the Cover Date.     

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.

     

OSCILLATION CONVERGENT THEOREMS FOR THE V^2-INTEGRAL

The V^t-integral as defined in[2], which is eqnivalent to M^2-integrsl as defined in Trigonometre series by Zygmund is used to sum trigonometric seies in[1]. In this paper, some convergent theorems of V^2-integral are established.     

关于均值KIRCHHOFF板非线性边界镇定问题的几点注记

对于均值K IRCHHOFF板非线性边界镇定问题给出几点注记.首先应用G reen公式对具有非线性边界反馈控制的均值K IRCHHOFF板所决定的非线性系统的能量衰减速度进行了重新推导,从而修正了前人的结果.然后应用极大单调函数的定义和分部积分技巧,对均值K IRCHHOFF板非线性边界镇定问题所决定的非线性算子A的极大单调性给出了重新证明,进而更正了已有文献中相应证明的欠妥之处.     

Monotone Chemical Reaction Networks

We analyze certain chemical reaction networks and show that every solution converges to some steady state. The reaction kinetics are assumed to be monotone but otherwise arbitrary. When diffusion effects are taken into account, the conclusions remain unchanged. The main tools used in our analysis come from the theory of monotone dynamical systems. We review some of the features of this theory and provide a self-contained proof of a particular attractivity result which is used in proving our main result.     

A priori error estimates for numerical methods for scalar conservation laws. Part I: The general approach

In this paper, we construct a general theory of a priori error estimates for scalar conservation laws by suitably modifying the original Kuznetsov approximation theory. As a first application of this general technique, we show that error estimates for conservation laws can be obtained without having to use explicitly any regularity properties of the approximate solution. Thus, we obtain optimal error estimates for the Engquist-Osher scheme without using the fact (i) that the solution is uniformly bounded, (ii) that the scheme is total variation diminishing, and (iii) that the discrete semigroup associated with the scheme has the -contraction property, which guarantees an upper bound for the modulus of continuity in time of the approximate solution.

     

Alternating Sign Matrices and Some Deformations of Weyl's Denominator Formulas

An alternating sign matrix is a square matrix whose entries are 1, 0, or –1, and which satisfies certain conditions. Permutation matrices are alternating sign matrices. In this paper, we use the (generalized) Littlewood's formulas to expand the products and 2 as sums indexed by sets of alternating sign matrices invariant under a 180° rotation. If we put t = 1, these expansion formulas reduce to the Weyl's denominator formulas for the root systems of type B _n and C _n. A similar deformation of the denominator formula for type D _n is also given.     

A convergence result for a sequence of distributed-parameter optimal control problems

In this paper, we consider a sequence of abstract optimal control problems by allowing the cost integrand, the partial differential operator, and the control constraint set all to vary simultaneously. Using the notions of -convergence of functions,G-convergence of operators, and Kuratowski-Mosco convergence of sets, we show that the values of the approximating problems converge to that of the limit problem. Also we show that a convergent sequence of optimal pairs for the approximating problems has a limit which is optimal for the limit problem. A concrete example of parabolic optimal control problems is worked out in detail.This research was supported by NSF Grant No. DMS-88-02688.     

Optimal monotone hysteretic Markov policies in anM/M/1 queueing model with switching costs and finite time horizon

In anM/M/1 queueing model, a decision maker can choosem pairs of arrival- and service rates. He can change his action at any time epoch, a switch of action costs an amount depending on the size of the switch. Besides that there are continuously incurring costs. Over a finite time horizon, there exists an optimal monotone hysteretic Markov policy. This is shown essentially by the technique of time discretization.The work producing this article was done during a half year stay at the University of Leiden, The Netherlands, with Prof. Arie Hordijk. A technical report (a more detailled version of this article) was written there [6]. The opportunity for this stay was given by the University of Bonn, Germany, where the author, at that time, worked as scientific assistant of Prof. M. Schäl.