An inexact ℓ1penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity
From MaRDI portal
Publication:2867419
DOI10.1080/10556788.2011.651082zbMath1278.49040OpenAlexW2045323724MaRDI QIDQ2867419
Publication date: 19 December 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2011.651082
sequential quadratic programmingshape optimizationline searchiterative solutionengineering applicationinexact objective function evaluations
Numerical methods based on nonlinear programming (49M37) Optimization of other properties in solid mechanics (74P10) Optimization of shapes other than minimal surfaces (49Q10) Methods of successive quadratic programming type (90C55)
Related Items
Cites Work
- Matlab implementation of the finite element method in elasticity
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Convergence of quasi-Newton matrices generated by the symmetric rank one update
- A globally convergent method for nonlinear programming
- Analysis of Inexact Trust-Region SQP Algorithms
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- Optimization with PDE Constraints
- Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
- Adaptive multivlevel methods in three space dimensions
- Global convergence of inexact reduced sqp methods
- Trust Region Methods
- 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
- Introduction to Shape Optimization
- Inexact SQP Interior Point Methods and Large Scale Optimal Control Problems
- Methods of conjugate gradients for solving linear systems
