Reduced quasi-Newton method for simultaneous design and optimization

DOI10.1007/s10589-009-9306-xzbMath1251.90364OpenAlexW2029799595WikidataQ57389622 ScholiaQ57389622MaRDI QIDQ548686

Adel Hamdi, Andreas Griewank

Publication date: 30 June 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-009-9306-x

zbMATH Keywords

global convergencepreconditioningaugmented Lagrangianexact penalty functionsimultaneous analysis and design

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (12)

New results for the handling of additional equality constraints in one-shot optimization ⋮ Combining Sobolev smoothing with parameterized shape optimization ⋮ Simultaneous single-step one-shot optimization with unsteady PDEs ⋮ Adaptive sequencing of primal, dual, and design steps in simulation based optimization ⋮ A combination of Kohn-Vogelius and DDM methods for a geometrical inverse problem ⋮ A practical globalization of one-shot optimization for optimal design of tokamak divertors ⋮ One-shot methods in function space for PDE-constrained optimal control problems ⋮ A one-shot optimization framework with additional equality constraints applied to multi-objective aerodynamic shape optimization ⋮ On an extension of one-shot methods to incorporate additional constraints ⋮ Augmenting the one-shot framework by additional constraints ⋮ A persistent adjoint method with dynamic time-scaling and an application to mass action kinetics ⋮ A non-intrusive parallel-in-time approach for simultaneous optimization with unsteady PDEs

Uses Software

• ADOL-C

Cites Work

• Reduced functions, gradients and Hessians from fixed-point iterations for state equations
• Approximate Nullspace Iterations for KKT Systems
• Properties of an augmented Lagrangian for design optimization
• Preconditioning of One-Shot Pseudo-Timestepping Methods for Shape Optimization
• A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
• A Convergence Theory for a Class of Quasi-Newton Methods for Constrained Optimization
• Numerical Optimization
• Extension of fixed point PDE solvers for optimal design by one-shot method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reduced quasi-Newton method for simultaneous design and optimization