Boundedness of Multilinear Operators on Herz Type Spaces： Extreme Cases

In this paper, two classes of closely related multilinear singular and fractional integrals,which include the commutators as special cases, are studied and their boundedness on Herz type spaces is discussed. In fact, it is proved that these operators are actually not bounded in certain extreme cases.     

CONVERGENCE OF SOLUTIONS FOR A CLASS OF DIFFERENCE EQUATIONS WITH VARIABLE DELAY

Ｃｏｎｓｉｄｅｒｔｈｅｄｉｆｅｒｅｎｃｅｅｑｕａｔｉｏｎｗｉｔｈａｖａｒｉａｂｌｅｄｅｌａｙｘｎ－ｘｎ－１＝Ｆ（ｘｎ，ｘｒ（ｎ），ｎ＝ｎ０，ｎ０＋１，…（１）ｗｈｅｒｅ（Ｈ１）：Ｆ∈Ｃ（Ｒ×Ｒ，Ｒ），Ｆ（ｕ，ｖ）ｉｓｄｅｃｒｅａｓｉｎｇｗｉｔｈｒｅｓ...     

On a Class of Functionals Whose Local Minima are Global

In this note we introduce a suitable class of functionals, including the class of integral functionals, and prove that any (strict) local minimum of a functional of this class, defined on a decomposable space, is a (strict) global minimum. So, the recent result obtained by Giner in [1] is specified and extended.     

The projective method for solving linear matrix inequalities

Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed.     

Control Policy for a Manufacturing System with Random Yield and Rework

We develop a production policy that controls work-in-process (WIP) levels and satisfies demand in a multistage manufacturing system with significant uncertainty in yield, rework, and demand. The problem addressed in this paper is more general than those in the literature in three aspects: (i) multiple products are processed at multiple workstations, and the capacity of each workstation is limited and shared by multiple operations; (ii) the behavior of a production policy is investigated over an infinite-time horizon, and thus the system stability can be evaluated; (iii) the representation of yield and rework uncertainty is generalized. Generalizing both the system structure and the nature of uncertainty requires a new mathematical development in the theory of infinite-horizon stochastic dynamic programming. The theoretical contributions of this paper are the existence proofs of the optimal stationary control for a stochastic dynamic programming problem and the finite covariances of WIP and production levels under the general expression of uncertainty. We develop a simple and explicit sufficient condition that guarantees the existence of both the optimal stationary control and the system stability. We describe how a production policy can be constructed for the manufacturing system based on the propositions derived.     

Efficient Sequential Quadratic Programming Implementations for Equality-Constrained Discrete-Time Optimal Control

Efficient sequential quadratic programming (SQP) implementations are presented for equality-constrained, discrete-time, optimal control problems. The algorithm developed calculates the search direction for the equality-based variant of SQP and is applicable to problems with either fixed or free final time. Problem solutions are obtained by solving iteratively a series of constrained quadratic programs. The number of mathematical operations required for each iteration is proportional to the number of discrete times N. This is contrasted by conventional methods in which this number is proportional to N ³. The algorithm results in quadratic convergence of the iterates under the same conditions as those for SQP and simplifies to an existing dynamic programming approach when there are no constraints and the final time is fixed. A simple test problem and two application problems are presented. The application examples include a satellite dynamics problem and a set of brachistochrone problems involving viscous friction.     

边界衍射波理论公式的准确性数值分析

利用数值分析的方法分析了由边界波理论公式所得的圆形光阑衍射场的光强分布.通过对边界波理论公式所得的光强分布曲线,对几何照明区与阴影区的光强分布曲线与面衍射积分公式所得的光强分布曲线进行比较,分析了边界波理论公式对衍射场描述的准确性.     

Fractional programming and characterization of some vertices of the feasible region

This paper considers a problem of nonlinear programming in which the objective function is the ratio of two linear functions and the constraints define a bounded and connected feasible region. Using a coordinate transformation, this problem is transformed into a simpler one, whose geometric interpretation is of particular significance. The transformation leads to a characterization of some special vertices of the feasible region from both the theoretical and operational points of view.     

STRONG DERIVATIVE AND ITS CONSEQUENCES

We introduce strong derivative, the corresponding Z-integrable and other related concepts. Also, we give an improved version of the fundamental theorem of calculus.     

Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints

In this paper, we extend the classical convergence and rate of convergence results for the method of multipliers for equality constrained problems to general inequality constrained problems, without assuming the strict complementarity hypothesis at the local optimal solution. Instead, we consider an alternative second-order sufficient condition for a strict local minimum, which coincides with the standard one in the case of strict complementary slackness. As a consequence, new stopping rules are derived in order to guarantee a local linear rate of convergence for the method, even if the current Lagrangian is only asymptotically minimized in this more general setting. These extended results allow us to broaden the scope of applicability of the method of multipliers, in order to cover all those problems admitting loosely binding constraints at some optimal solution. This fact is not meaningless, since in practice this kind of problem seems to be more the rule rather than the exception.In proving the different results, we follow the classical primaldual approach to the method of multipliers, considering the approximate minimizers for the original augmented Lagrangian as the exact solutions for some adequate approximate augmented Lagrangian. In particular, we prove a general uniform continuity property concerning both their primal and their dual optimal solution set maps, a property that could be useful beyond the scope of this paper. This approach leads to very simple proofs of the preliminary results and to a straight-forward proof of the main results.The author gratefully acknowledges the referees for their helpful comments and remarks. This research was supported by FONDECYT (Fondo Nacional de Desarrollo Científico y Technológico de Chile).