• Login
    View Item 
    •   DSpace@RPI Home
    • Rensselaer Libraries
    • RPI Theses Online (Complete)
    • View Item
    •   DSpace@RPI Home
    • Rensselaer Libraries
    • RPI Theses Online (Complete)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    A matrix-free algorithm for reduced-space PDE-constrained optimization

    Author
    Meng, Pengfei
    View/Open
    178972_Meng_rpi_0185E_11276.pdf (4.972Mb)
    Other Contributors
    Hicken, Jason; Oberai, Assad; Zhang, Lucy T.; Mitchell, John E.;
    Date Issued
    2018-05
    Subject
    Aeronautical engineering
    Degree
    PhD;
    Terms of Use
    This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.;
    Metadata
    Show full item record
    URI
    https://hdl.handle.net/20.500.13015/2187
    Abstract
    This thesis present a matrix-free method for partial differential equation (PDE) constrained optimization problems formulated in the reduced space. When many state-based constraints are present in the reduced-space formulation, the constraint Jacobian can become prohibitively expensive to compute explicitly, because each constraint gradient requires the solution of a distinct adjoint PDE. This leads many practitioners to use constraint aggregation, which can produce overly conservative solutions. To avoid conservative solutions as well as the expense of forming the constraint Jacobian, we adopt a matrix-free inexact-Krylov optimization framework. This choice introduces additional challenges related to globalization and preconditioning. To address globalization, the proposed method uses a homotopy continuation approach and a predictor-corrector algorithm to trace the solution curve. The predictor and corrector linear systems are solved using a Krylov iterative method with the necessary matrix-vector products evaluated via second-order adjoints. To cope with the poorly conditioned primal-dual system, a matrix-free preconditioner is proposed that uses a low-rank approximation of the Schur complement of the primal- dual matrix; the low-rank approximation is constructed using a fixed number of iterations of the Lanczos method. The algorithm is verified using analytical problems, a subset of CUTEr problems, a stress-constrained mass minimization problem, and an aerodynamic shape optimization problem. The method shows promising performance relative to a state-of-the-art matrix-based active-set algorithm, particularly for large numbers of design variables.;
    Description
    May 2018; School of Engineering
    Department
    Dept. of Mechanical, Aerospace, and Nuclear Engineering;
    Publisher
    Rensselaer Polytechnic Institute, Troy, NY
    Relationships
    Rensselaer Theses and Dissertations Online Collection;
    Access
    Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.;
    Collections
    • RPI Theses Online (Complete)

    Browse

    All of DSpace@RPICommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2022  DuraSpace
    Contact Us | Send Feedback
    DSpace Express is a service operated by 
    Atmire NV