Preconditioners for state constrained optimal control problems\ud with Moreau-Yosida penalty function tube

Optimal control problems with partial differential equations play an important role in many applications. The inclusion of bound constraints for the state poses a significant challenge for optimization methods. Our focus here is on the incorporation of the constraints via the Moreau-Yosida regularization technique. This method has been studied recently and has proven to be advantageous compared to other approaches. In this paper we develop preconditioners for the efficient solution of the Newton steps associated with the fast solution of the Moreau-Yosida regularized problem. Numerical results illustrate the competitiveness of this approach. \ud \ud Copyright c 2000 John Wiley & Sons, Ltd

All-at-Once Solution if Time-Dependent PDE-Constrained Optimisation Problems

Time-dependent partial differential equations (PDEs) play an important role in applied mathematics and many other areas of science. One-shot methods try to compute the solution to these problems in a single iteration that solves for all time-steps at the same time. In this paper, we look at one-shot approaches for the optimal control of time-dependent PDEs and focus on the fast solution of these problems. The use of Krylov subspace solvers together with an efficient preconditioner allows for minimal storage requirements. We solve only approximate time-evolutions for both forward and adjoint problem and compute accurate solutions of a given control problem only at convergence of the overall Krylov subspace iteration. We show that our approach can give competitive results for a variety of problem formulations

The Bramble-Pasciak preconditioner for saddle point problems

The Bramble-Pasciak Conjugate Gradient method is a well known tool to solve linear systems in saddle point form. A drawback of this method in order to ensure applicability of Conjugate Gradients is the need for scaling the preconditioner which typically involves the solution of an eigenvalue problem. Here, we introduce a modified preconditioner and inner product which without scaling enable the use of a MINRES variant and can be used for the simplified Lanczos process. Furthermore, the modified preconditioner and inner product can be combined with the original Bramble-Pasciak setup to give new preconditioners and inner products. We undermine the new methods by showing numerical experiments for Stokes problems

All-at-once solution of time-dependent PDE-constrained optimization problems

Time-dependent partial differential equations (PDEs) play an important role in applied mathematics and many other areas of science. One-shot methods try to compute the solution to these problems in a single iteration that solves for all time-steps at the same time. In this paper, we look at one-shot approaches for the optimal control of time-dependent PDEs and focus on the fast solution of these problems. The use of Krylov subspace solvers together with an efficient preconditioner allows for minimal storage requirements. We solve only approximate time-evolutions for both forward and adjoint problem and compute accurate solutions of a given control problem only at convergence of the overall Krylov subspace iteration. We show that our approach can give competitive results for a variety of problem formulations

Preconditioning for active set and projected gradient methods as\ud semi-smooth Newton methods for PDE-constrained optimization\ud with control constraints

Optimal control problems with partial differential equations play an important role in many applications. The inclusion of bound constraints for the control poses a significant additional challenge for optimization methods. In this paper we propose preconditioners for the saddle point problems that arise when a primal-dual active set method is used. We also show for this method that the same saddle point system can be derived when the method is considered as a semi-smooth Newton method. In addition, the projected gradient method can be employed to solve optimization problems with simple bounds and we discuss the efficient solution of the linear systems in question. In the case when an acceleration technique is employed for the projected gradient method, this again yields a semi-smooth Newton method that is equivalent to the primal-dual active set method. Numerical results illustrate the competitiveness of this approach

Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences

Motivated by the known autocorrelation properties of the Rudin-Shapiro sequence, we study the discrete correlation among infinite sequences over a finite alphabet, where we just take into account whether two symbols are identical. We show by combinatorial means that sequences cannot be "too" different, and by an explicit construction generalizing the Rudin-Shapiro sequence, we show that we can achieve the maximum possible difference.Comment: Improved Introduction and new Section 6 (Lovasz local lemma

Real-time simulation of finite frequency noise from a single electron emitter

We study the real-time emission of single electrons from a quantum dot coupled to a one dimensional conductor, using exact diagonalization on a discrete tight-binding chain. We show that from the calculation of the time-evolution of the one electron states, we have a simple access to all the relevant physical quantities in the system. In particular, we are able to compute accurately the finite frequency current autocorrelation noise. The method which we use is general and versatile, allowing to study the impact of many different parameters like the dot transparency or level position. Our results can be directly compared with existing experiments, and can also serve as a basis for future calculations including electronic interactions using the time dependent density-matrix renormalisation group and other techniques based on tight-binding models.Comment: 10 page

Employer Demand for Welfare Recipients by Race

This paper uses new survey data on employers in four large metropolitan areas to examine the determinants of employer demand for welfare recipients. The results suggest a high level of demand for welfare recipients, though such demand appears fairly sensitive to business cycle conditions. A broad range of factors, including skill needs and industry, affect the prospective demand for welfare recipients among employers, while other characteristics that affect the relative supply of welfare recipients to these employers (such as location and employer use of local agencies or welfare-to-work programs) influence the extent to which such demand is realized in actual hiring. Moreover, the conditional demand for black (and to a lesser extent Hispanic) welfare recipients lags behind their representation in the welfare population and seems to be more heavily affected by employers’ location and indicators of preferences than by their skill needs or overall hiring activity. Thus, a variety of factors on the demand side of the labor market continue to limit the employment options of welfare recipients, especially those who are minorities.

Approximation of the scattering amplitude

The simultaneous solution of Ax=b and ATy=g is required in a number of situations. Darmofal and Lu have proposed a method based on the Quasi-Minimal residual algorithm (QMR). We will introduce a technique for the same purpose based on the LSQR method and show how its performance can be improved when using the Generalized LSQR method. We further show how preconditioners can be introduced to enhance the speed of convergence and discuss different preconditioners that can be used. The scattering amplitude gTx, a widely used quantity in signal processing for example, has a close connection to the above problem since x represents the solution of the forward problem and g is the right hand side of the adjoint system. We show how this quantity can be efficiently approximated using Gauss quadrature and introduce a Block-Lanczos process that approximates the scattering amplitude and which can also be used with preconditioners