Convergence Analysis of a Class of Penalty Methods for Vector Optimization Problems with Cone Constraints

In this paper, we consider convergence properties of a class of penalization methods for a general vector optimization problem with cone constraints in infinite dimensional spaces. Under certain assumptions, we show that any efficient point of the cone constrained vector optimization problem can be approached by a sequence of efficient points of the penalty problems. We also show, on the other hand, that any limit point of a sequence of approximate efficient solutions to the penalty problems is a weekly efficient solution of the original cone constrained vector optimization problem. Finally, when the constrained space is of finite dimension, we show that any limit point of a sequence of stationary points of the penalty problems is a KKT stationary point of the original cone constrained vector optimization problem if Mangasarian–Fromovitz constraint qualification holds at the limit point.This work is supported by the Postdoctoral Fellowship of Hong Kong Polytechnic University.     

Switching Time and Parameter Optimization in Nonlinear Switched Systems with Multiple Time-Delays

In this paper, we consider a dynamic optimization problem involving a general switched system that evolves by switching between several subsystems of nonlinear delay-differential equations. The optimization variables in this system consist of: (1) the times at which the subsystem switches occur; and (2) a set of system parameters that influence the subsystem dynamics. We first establish the existence of the partial derivatives of the system state with respect to both the switching times and the system parameters. Then, on the basis of this result, we show that the gradient of the cost function can be computed by solving the state system forward in time followed by a costate system backward in time. This gradient computation procedure can be combined with any gradient-based optimization method to determine the optimal switching times and parameters. We propose an effective optimization algorithm based on this idea. Finally, we consider three numerical examples, one involving the 1,3-propanediol fed-batch production process, to illustrate the effectiveness and applicability of the proposed algorithm.     

A review of methods and algorithms for optimizing construction scheduling

Optimizing construction project scheduling has received a considerable amount of attention over the past 20 years. As a result, a plethora of methods and algorithms have been developed to address specific scenarios or problems. A review of the methods and algorithms that have been developed to examine the area of construction schedule optimization (CSO) is undertaken. The developed algorithms for solving the CSO problem can be classified into three methods: mathematical, heuristic and metaheuristic. The application of these methods to various scheduling problems is discussed and implications for future research are identified.     

Theory of twist liquids: Gauging an anyonic symmetry

Topological phases in (2+1)$(2+1)$-dimensions are frequently equipped with global symmetries, like conjugation, bilayer or electric–magnetic duality, that relabel anyons without affecting the topological structures. Twist defects are static point-like objects that permute the labels of orbiting anyons. Gauging these symmetries by quantizing defects into dynamical excitations leads to a wide class of more exotic topological phases referred as twist liquids  , which are generically non-Abelian. We formulate a general gauging framework, characterize the anyon structure of twist liquids and provide solvable lattice models that capture the gauging phase transitions. We explicitly demonstrate the gauging of the Z₂${\mathbb{Z}}_2$-symmetric toric code, SO(2N)₁$SO{\left(2N\right)}_1$ and SU(3)₁$SU{\left(3\right)}_1$ state as well as the S₃$S_3$-symmetric SO(8)₁$SO{\left(8\right)}_1$ state and a non-Abelian chiral state we call the “4-Potts” state.     

Existence and uniqueness of solutions of piecewise nonlinear systems

In this paper, we consider the existence and the uniqueness of solutions of piecewise nonlinear systems. We will present some necessary and sufficient conditions for the existence and the uniqueness of solutions of this class of systems.     

A structurally characterized Ni-Al methyl-bridged complex with catalytic ethylene oligomerization activity

A bimetallic Ni-Al (2.5087(15) A) complex with an agostic alpha-C-H, [eta-C5H4CH=N(C6F5)]Fe[eta-C5H4PPh2]Ni(AlMe3), has been isolated and crystallographically established. The complex is active towards ethylene oligomerization/polymerization under moderate conditions.     

Razumikhin-type theorems on exponential stability of impulsive delay systems

^** Corresponding author. Email: xzliu{at}math.uwaterloo.ca This paper studies the exponential stability of impulsive delaysystems. By employing the Razumikhin technique and Lyapunovfunctions, several exponential stability criteria are establishedfor both linear and non-linear impulsive delay systems. Someexamples are also worked through to illustrate our results.     

Necessary and Sufficient Optimality Conditions for Regular–Singular Stochastic Differential Games with Asymmetric Information

We consider a class of regular–singular stochastic differential games arising in the optimal investment and dividend problem of an insurer under model uncertainty. The information available to the two players is asymmetric partial information and the control variable of each player consists of two components: regular control and singular control. We establish the necessary and sufficient optimality conditions for the saddle point of the zero-sum game. Then, as an application, these conditions are applied to an optimal investment and dividend problem of an insurer under model uncertainty. Furthermore, we generalize our results to the nonzero-sum regular–singular game with asymmetric information, and then the Nash equilibrium point is characterized.