Spectral estimates for saddle point matrices arising in weak constraint four‐dimensional variational data assimilation

We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds.     

Inner derivations and norm equality

We characterize when the norm of the sum of two bounded operators on a Hilbert space is equal to the sum of their norms.

     

Constraint Programming and Operations Research: Comments from an Operations Researcher

This paper relates the author's personal experience with constraint programming and gives a personal assessment of the relationships between constraint programming and operations research.     

运用量子约束动力学对具有耗散的量子位的追踪控制

在有限温度环境内，量子约束动力学及其追踪控制可使退相干系统的相干性稳定一段时间.约束方程产生的控制场能够按量子比特的动力学状态进行控制(量子动力学轨道的反馈控制)；依靠量子比特的这种反馈效应，可使量子位稳定在设定的时间内.同时，在量子位的稳定方面，温度扮演一种消极的角色. 关键词： 量子约束动力学 耗散量子位的控制 追踪控制 量子比特的反馈效应     

Optimal Control of Non-well-posed Heat Equations

This work is concerned with Pontryagin＇s maximum principle of optimal control problems governed by some non-well-posed semilinear heat equations. A type of approach to the non-well-posed optimal control problem is given.     

Upper bounds on correlation decay for one-dimensional long-range spin-glass models

Some recent results on one-dimensional spin-glass models with polynomially decreasing interactions are described.     

具有算子与有界约束的无穷维规划问题的最优性条件

本文给出了当all-at-once方法用于求解最优控制问题而产生的一类同时具有算子和对部分变量具有简单界约束的无穷维最优化问题的一个一阶必要条件,构造了相应的信赖域子问题,据此,信赖域法可以用于求解无穷空间中的最优化问题。     

资源有限的加权总完工时间单机排序问题

本讨论资源有限的加权总工时间单机排序问题，对现在仍为OPEN问题1｜pj=bj-ajuj，∑uj≤U｜∑wjCj给出了一个有关最优解中最优资源分配的重要性质，并利用该性质分别给出了三种情况bj=b,wj=w,aj=a；bj=b,wj=w,uj=u；aj=a,wj=w,uj=u的最优算法。     

Fractional Brownian Heavy Traffic Approximations of Multiclass Feedforward Queueing Networks

We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20     

On Constraint Qualifications in Nonsmooth Optimization

We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here.