An inexact ℓ1penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity

DOI10.1080/10556788.2011.651082MaRDI QIDQ2867419zbMATH OpenOpenAlexFDO

Authors Wolfgang Hess, Stefan Ulbrich

Publication date 19 December 2013

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2011.651082

zbMATH Keywords

engineering applicationinexact objective function evaluationsiterative solutionline searchsequential quadratic programmingshape optimization

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Optimization of shapes other than minimal surfaces (49Q10) Optimization of other properties in solid mechanics (74P10) Methods of successive quadratic programming type (90C55)

Recommendations

• scientific article; zbMATH DE number 3934328
• An Inexact Trust-Region SQP Method with Applications to PDE-Constrained Optimization
• Towards a Lagrange-Newton approach for PDE constrained shape optimization
• Relaxed Dirichlet problem and shape optimization within the linear elasticity framework
• An interior-point _1-penalty method for nonlinear optimization
• A penalization and regularization technique in shape optimization problems
• scientific article; zbMATH DE number 1569656
• Uniformly convergent interior penalty methods using multilinear approximations for problems in elasticity
• An optimization algorithm applied to the Morrey conjecture in nonlinear elasticity
• Inexact interior-point method for PDE-constrained nonlinear optimization

Cites work

• A globally convergent method for nonlinear programming
• Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
• Adaptive multivlevel methods in three space dimensions
• Analysis of inexact trust-region SQP algorithms
• Convergence of quasi-Newton matrices generated by the symmetric rank one update
• Each averaging technique yields reliable a posteriori error control in FEM on unstructured grids. Part II: Higher order FEM
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• Global convergence of inexact reduced sqp methods
• Inexact SQP Interior Point Methods and Large Scale Optimal Control Problems
• Infeasibility Detection and SQP Methods for Nonlinear Optimization
• Introduction to Shape Optimization
• Matlab implementation of the finite element method in elasticity
• Methods of conjugate gradients for solving linear systems
• Optimization with PDE Constraints
• Trust Region Methods
• Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems

Cited in

(4)

• State space Newton's method for topology optimization
• Adaptive SQP method for shape optimization
• Geometry optimization with PDE constraints and applications to the design of branched sheet metal products.
• Line-search based optimization using function approximations with tunable accuracy

This page was built for publication: An inexact ℓ₁penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867419)