18 research outputs found

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

    Get PDF
    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

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

    Get PDF
    Optimal control problems with partial differential equations as constraints play an important role in many applications. The inclusion of bound constraints for the state variable 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 robust preconditioners for the efficient solution of the Newton steps associated with solving the Moreau-Yosida regularized problem. Numerical results illustrate the efficiency of our approach

    Solving optimal control problems governed by random Navier-Stokes equations using low-rank methods

    Full text link
    Many problems in computational science and engineering are simultaneously characterized by the following challenging issues: uncertainty, nonlinearity, nonstationarity and high dimensionality. Existing numerical techniques for such models would typically require considerable computational and storage resources. This is the case, for instance, for an optimization problem governed by time-dependent Navier-Stokes equations with uncertain inputs. In particular, the stochastic Galerkin finite element method often leads to a prohibitively high dimensional saddle-point system with tensor product structure. In this paper, we approximate the solution by the low-rank Tensor Train decomposition, and present a numerically efficient algorithm to solve the optimality equations directly in the low-rank representation. We show that the solution of the vorticity minimization problem with a distributed control admits a representation with ranks that depend modestly on model and discretization parameters even for high Reynolds numbers. For lower Reynolds numbers this is also the case for a boundary control. This opens the way for a reduced-order modeling of the stochastic optimal flow control with a moderate cost at all stages.Comment: 29 page

    SUFFICIENT OPTIMALITY CONDITIONS FOR THE MOREAU-YOSIDA TYPE REGULARIZATION CONCEPT APPLIED TO SEMILINEAR ELLIPTIC OPTIMAL CONTROL PROBLEMS WITH POINTWISE STATE CONSTRAINTS

    Get PDF
    We develop sufficient optimality conditions for a Moreau-Yosidaregularized optimal control problem governed by a semilinear ellipticPDE with pointwise constraints on the state and the control. We makeuse of the equivalence of a setting of Moreau-Yosida regularization to a special setting of the virtual control concept,for which standard second order sufficient conditions have been shown. Moreover, we present a numerical example,solving a Moreau-Yosida regularized model problem with an SQP method

    Preconditioning of Active-Set Newton Methods for PDE-constrained Optimal Control Problems

    Full text link
    We address the problem of preconditioning a sequence of saddle point linear systems arising in the solution of PDE-constrained optimal control problems via active-set Newton methods, with control and (regularized) state constraints. We present two new preconditioners based on a full block matrix factorization of the Schur complement of the Jacobian matrices, where the active-set blocks are merged into the constraint blocks. We discuss the robustness of the new preconditioners with respect to the parameters of the continuous and discrete problems. Numerical experiments on 3D problems are presented, including comparisons with existing approaches based on preconditioned conjugate gradients in a nonstandard inner product

    A priori error analysis for state constrained boundary control problems : Part I: Control discretization

    Get PDF
    This is the first of two papers concerned with a state-constrained optimal control problems with boundary control, where the state constraints are only imposed in an interior subdomain. We apply the virtual control concept introduced in [20] to regularize the problem. The arising regularized optimal control problem is discretized by finite elements and linear and continuous ansatz functions for the boundary control. In the first part of the work, we investigate the errors induced by the regularization and the discretization of the boundary control. The second part deals with the error arising from discretization of the PDE. Since the state constraints only appear in an inner subdomain, the obtained order of convergence exceeds the known results in the field of a priori analysis for state-constrained problem
    corecore