### A collocation method for optimal control of linear systems with inequality constraints.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

We provide a local as well as a semilocal convergence analysis for Newton's method to approximate a locally unique solution of an equation in a Banach space setting. Using a combination of center-gamma with a gamma-condition, we obtain an upper bound on the inverses of the operators involved which can be more precise than those given in the elegant works by Smale, Wang, and Zhao and Wang. This observation leads (under the same or less computational cost) to a convergence analysis with the following...

Using the Haar-Kármán principle, approximate solutions of the basic boundary value problems are proposed and studied, which consist of piecewise linear stress fields on composite triangles. The torsion problem is solved in an analogous manner. Some convergence results are proven.

We address in this article the computation of the convex solutions of the Dirichlet problem for the real elliptic Monge − Ampère equation for general convex domains in two dimensions. The method we discuss combines a least-squares formulation with a relaxation method. This approach leads to a sequence of Poisson − Dirichlet problems and another sequence of low dimensional algebraic eigenvalue problems of a new type. Mixed finite element approximations with a smoothing procedure are used for the...

This work is concerned with a class of minimum effort problems for partial differential equations, where the control cost is of L∞-type. Since this problem is non-differentiable, a regularized functional is introduced that can be minimized by a superlinearly convergent semi-smooth Newton method. Uniqueness and convergence for the solutions to the regularized problem are addressed, and a continuation strategy based on a model function is proposed. Numerical examples for a convection-diffusion equation...

In this paper, we present a new one-step smoothing Newton method for solving the second-order cone programming (SOCP). Based on a new smoothing function of the well-known Fischer-Burmeister function, the SOCP is approximated by a family of parameterized smooth equations. Our algorithm solves only one system of linear equations and performs only one Armijo-type line search at each iteration. It can start from an arbitrary initial point and does not require the iterative points to be in the sets...

Motivated by the pricing of American options for baskets we consider a parabolic variational inequality in a bounded polyhedral domain $\Omega \subset {\mathbb{R}}^{d}$ with a continuous piecewise smooth obstacle. We formulate a fully discrete method by using piecewise linear finite elements in space and the backward Euler method in time. We define an a posteriori error estimator and show that it gives an upper bound for the error in L2(0,T;H1(Ω)). The error estimator is localized in the sense that the size of the elliptic residual...

Shape optimization is described by finding the geometry of a structure which is optimal in the sense of a minimized cost function with respect to certain constraints. A Newton’s mesh independence principle was very efficiently used to solve a certain class of optimal design problems in [6]. Here motivated by optimization considerations we show that under the same computational cost an even finer mesh independence principle can be given.

Semi-smooth Newton methods for elliptic equations with gradient constraints are investigated. The one- and multi-dimensional cases are treated separately. Numerical examples illustrate the approach and as well as structural features of the solution.

Sensitivity analysis (with respect to the regularization parameter) of the solution of a class of regularized state constrained optimal control problems is performed. The theoretical results are then used to establish an extrapolation-based numerical scheme for solving the regularized problem for vanishing regularization parameter. In this context, the extrapolation technique provides excellent initializations along the sequence of reducing regularization parameters. Finally, the favorable numerical behavior...

We present an a posteriori error analysis of adaptive finite element approximations of distributed control problems for second order elliptic boundary value problems under bound constraints on the control. The error analysis is based on a residual-type a posteriori error estimator that consists of edge and element residuals. Since we do not assume any regularity of the data of the problem, the error analysis further invokes data oscillations. We prove reliability and efficiency of the error estimator...