Optimal control of systems governed by a class of nonlinear evolution equations in a reflexive Banach space

The paper presents a closure theorem for the attainable trajectories of a class of control systems governed by a large class of nonlinear evolution equations in reflexive Banach spaces. Several existence theorems for optimal controls are proven that include a terminal control problem, a time-optimal control problem, and a special Bolza problem. Some results of independent interest are also presented.This work was supported in part by the National Research Council of Canada under Grant No. 7109.The authors would like to thank Professor L. Cesari for pointing out that joint continuity off is required for the setsG andR to satisfy the upper semicontinuity property (Theorems 5.1 and 5.2).     

Formation of silicon carbide nanotubes and nanowires via reaction of silicon (from disproportionation of silicon monoxide) with carbon nanotubes

One-dimensional silicon-carbon nanotubes and nanowires of various shapes and structures were synthesized via the reaction of silicon (produced by disproportionation reaction of SiO) with multiwalled carbon nanotubes (as templates) at different temperatures. A new type of multiwalled silicon carbide nanotube (SiCNT), with 3.5-4.5 A interlayer spacings, was observed in addition to the previously known beta-SiC (cubic zinc blende structure) nanowires and the biaxial SiC-SiO(x) nanowires. The SiCNT was identified by high-resolution transmission microscopy (HRTEM), elemental mapping, and electron energy loss spectroscopy (EELS). The multiwalled SiCNT was found to transform to a beta-SiC crystalline structure by electron beam annealing under TEM.     

Sharp bounds for the number of 3‐independent partitions and the chromaticity of bipartite graphs

Given a graph G and an integer k ≥ 1, let α(G, k) denote the number of k‐independent partitions of G. Let ??^?s(p,q) (resp., ??₂^?s(p,q)) denote the family of connected (resp., 2‐connected) graphs which are obtained from the complete bipartite graph K_p,q by deleting a set of s edges, where p ≥ q ≥ 2. This paper first gives a sharp upper bound for α(G,3), where G ∈ ?? ^?s(p,q) and 0 ≤ s ≤ (p ? 1)(q ? 1) (resp., G ∈ ?? ₂^?s(p,q) and 0 ≤ s ≤ p + q ? 4). These bounds are then used to show that if G ∈ ?? ^?s(p,q) (resp., G ∈ ?? ₂^?s (p,q)), then the chromatic equivalence class of G is a subset of the union of the sets ??^?s_i(p+i,q?i) where max and s_i = s ? i(p?q+i) (resp., a subset of ??₂^?s(p,q), where either 0 ≤ s ≤ q ? 1, or s ≤ 2q ? 3 and p ≥ q + 4). By applying these results, we show finally that any 2‐connected graph obtained from K_p,q by deleting a set of edges that forms a matching of size at most q ? 1 or that induces a star is chromatically unique. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 48–77, 2001     

A new AF gravitational instanton

It has long been conjectured that the Euclidean Schwarzschild and Euclidean Kerr instantons are the only non-trivial asymptotically flat (AF) gravitational instantons. In this Letter, we show that this conjecture is false by explicitly constructing a new two-parameter AF gravitational instanton with a U(1)×U(1) isometry group, using the inverse-scattering method. It has Euler number χ=3 and Hirzebruch signature τ=1, and its global topology is CP² with a circle S¹ removed appropriately. Various other properties of this gravitational instanton are also discussed.     

A primal-dual interior point method for optimal zero-forcing beamformer design under per-antenna power constraints

In this paper, we consider an optimal zero-forcing beamformer design problem in multi-user multiple-input multiple-output broadcast channel. The minimum user rate is maximized subject to zero-forcing constraints and power constraint on each base station antenna array element. The natural formulation leads to a nonconvex optimization problem. This problem is shown to be equivalent to a convex optimization problem with linear objective function, linear equality and inequality constraints and quadratic inequality constraints. Here, the indirect elimination method is applied to reduce the convex optimization problem into an equivalent convex optimization problem of lower dimension with only inequality constraints. The primal-dual interior point method is utilized to develop an effective algorithm (in terms of computational efficiency) via solving the modified KKT equations with Newton method. Numerical simulations are carried out. Compared to algorithms based on a trust region interior point method and sequential quadratic programming method, it is observed that the method proposed is much superior in terms of computational efficiency.     

Second-order Karush–Kuhn–Tucker optimality conditions for set-valued optimization

In this paper, we propose the concept of a second-order composed contingent derivative for set-valued maps, discuss its relationship to the second-order contingent derivative and investigate some of its special properties. By virtue of the second-order composed contingent derivative, we extend the well-known Lagrange multiplier rule and the Kurcyusz–Robinson–Zowe regularity assumption to a constrained set-valued optimization problem in the second-order case. Simultaneously, we also establish some second-order Karush–Kuhn–Tucker necessary and sufficient optimality conditions for a set-valued optimization problem, whose feasible set is determined by a set-valued map, under a generalized second-order Kurcyusz–Robinson–Zowe regularity assumption.