Near-Optimal Controls of Discrete-Time Dynamic Systems Driven by Singularly-Perturbed Markov Chains

This work is devoted to near-optimal controls of large-scale discrete-time nonlinear dynamic systems driven by Markov chains; the underlying problem is to minimize an expected cost function. Our main goal is to reduce the complexity of the underlying systems. To achieve this goal, discrete-time control models under singularly-perturbed Markov chains are introduced. Using a relaxed control representation, our effort is devoted to finding near-optimal controls. Lumping the states in each irreducible class into a single state gives rise to a limit system. Applying near-optimal controls of the limit system to the original system, near-optimal controls of the original system are derived.     

Second order mixed type duality in multiobjective programming problems

Second order mixed type dual is introduced for multiobjective programming problems. Results about weak duality, strong duality, and strict converse duality are established under generalized second order (F,ρ)-convexity assumptions. These results generalize the duality results recently given by Aghezzaf and Hachimi involving generalized first order (F,ρ)-convexity conditions.     

Almost automorphic solutions for abstract functional differential equations

For abstract linear functional differential equations with an almost automorphic forcing term, we establish a result on the existence of almost automorphic solutions, which extends the classical theorem due to Massera on the existence of periodic solutions for linear periodic ordinary differential equations.     

A monotone iterative scheme for a nonlinear second order equation based on a generalized anti–maximum principle

In this paper, a generalized anti–maximum principle for the second order differential operator with potentials is proved. As an application, we will give a monotone iterative scheme for periodic solutions of nonlinear second order equations. Such a scheme involves the L^p norms of the growth, 1 ≤ p ≤ ∞, while the usual one is just the case p = ∞.     

General Information

In this paper, we propose and analyze an SQP-type method for solving linearly constrained convex minimization problems where the objective functions are too complex to be evaluated exactly. Some basic results for global convergence and local superlinear convergence are obtained according to the properties of the approximation sequence. We illustrate the applicability of our approach by proposing a new method for solving two-stage stochastic programs with fixed recourse.     

Structure of Regular Solutions of the Three-Body Schrödinger Equation near the Pair Impact Point

We investigate the six-dimensional Schrödinger equation for a three-body system with central pair interactions of a more general form than Coulomb interactions. Regular general and special physical solutions of this equation are represented by infinite asymptotic series in integer powers of the distance between two particles and in the sought functions of the other three-body coordinates. Constructing such functions in angular bases composed of spherical and bispherical harmonics or symmetrized Wigner D-functions is reduced to solving simple recursive algebraic equations. For projections of physical solutions on the angular bases functions, we derive boundary conditions at the pair impact point.     

Mappings of Domains in Rn and Their Metric Tensors

We consider quasi-isometric mappings of domains in multidimensional Euclidean spaces. We establish that a mapping depends continuously in the sense of the topology of Sobolev classes on its metric tensor to within isometry of the space. In the space of metric tensors we take the topology determined by means of almost everywhere convergence. We show that if the metric tensor of a mapping is continuous then the length of the image of a rectifiable curve is determined by the same formula as in the case of mappings with continuous derivatives. (Continuity of the metric tensor of a mapping does not imply continuity of its derivatives.)     

Blow-up solutions of nonlinear elliptic equations in ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript> with critical exponent <Emphasis Type="Italic">Dedicated to Philippe Dufour,whose exquisite horology artwork ‘‘Simplicity’’ inspires so much.</Emphasis>

For an integer n3 and any positive number , we establish the existence of smooth functions K on ⁿ {0} with |K–1|, such that the equation has a smooth positive solution which blows up at the origin (i.e., u does not have slow decay near the origin). Furthermore, we show that in some situations K can be extended as a Lipschitz function on ⁿ . These provide counter-examples to a conjecture of C.-S. Lin when n>4, and a question of Taliaferro. Mathematics Subject Classification (2000)Primary 35J60; Secondary 53C21     

Duality Theory in Fuzzy Linear Programming Problems with Fuzzy Coefficients

The concept of fuzzy scalar (inner) product that will be used in the fuzzy objective and inequality constraints of the fuzzy primal and dual linear programming problems with fuzzy coefficients is proposed in this paper. We also introduce a solution concept that is essentially similar to the notion of Pareto optimal solution in the multiobjective programming problems by imposing a partial ordering on the set of all fuzzy numbers. We then prove the weak and strong duality theorems for fuzzy linear programming problems with fuzzy coefficients.     

Rational Functions with Prescribed Global and Local Minimizers

A family of multivariate rational functions is constructed. It has strong local minimizers with prescribed function values at prescribed positions. While there might be additional local minima, such minima cannot be global. A second family of multivariate rational functions is given, having prescribed global minimizers and prescribed interpolating data.