A matrix-free augmented Lagrangian algorithm with application to large-scale structural design optimization
From MaRDI portal
Publication:2358024
DOI10.1007/s11081-015-9287-9zbMath1364.90388OpenAlexW2336722884MaRDI QIDQ2358024
Joaquim R. R. A. Martins, Dominique Orban, Sylvain Arreckx, Andrew B. Lambe
Publication date: 20 June 2017
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-015-9287-9
large-scale optimizationstructural optimizationaugmented LagrangianPDE-constrained optimizationmatrix-free optimization
Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Optimization of other properties in solid mechanics (74P10)
Related Items
Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem, Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- PyOpt: a python-based object-oriented framework for nonlinear constrained optimization
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- Simultaneous nonlinear structural analysis and design
- On the local convergence of adjoint Broyden methods
- Algorithms for bound constrained quadratic programming problems
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- Inexact Hessian-vector products in reduced-space differential-equation constrained optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- The multiplier method of Hestenes and Powell applied to convex programming
- On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
- From global to local convergence of interior methods for nonlinear optimization
- Convergence Theorems for Least-Change Secant Update Methods
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- Large-scale linearly constrained optimization
- On constrained optimization by adjoint based quasi-Newton methods
- Trust Region Methods
- A Regularized Factorization-Free Method for Equality-Constrained Optimization
- Two-Step Algorithms for Nonlinear Optimization with Structured Applications
- Newton's Method for Large Bound-Constrained Optimization Problems
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods
- A Globally Convergent Stabilized SQP Method
- CUTEr and SifDec
- Parallel Lagrange--Newton--Krylov--Schur Methods for PDE-Constrained Optimization. Part I: The Krylov--Schur Solver
- Benchmarking optimization software with performance profiles.
