Approximate nullspace iterations for KKT systems
DOI10.1137/080724952zbMATH Open1203.65091OpenAlexW2041557582WikidataQ57441995 ScholiaQ57441995MaRDI QIDQ3053124FDOQ3053124
Authors: Kazufumi Ito, Karl Kunisch, Volker Schulz, Ilia Gherman 
Publication date: 4 November 2010
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: http://unipub.uni-graz.at/doi/10.1137/080724952
Recommendations
- Numerical experience with iterative methods for equality constrained nonlinear programming problems
- Some iterative methods for the solution of a symmetric indefinite KKT system
- An inexact Newton method combined with Hestenes multipliers' scheme for the solution of Karush-Kuhn-Tucker systems
- Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods
- A simply constrained optimization reformulation of KKT systems arising from variational inequalities
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10) Control/observation systems governed by partial differential equations (93C20)
Cited In (9)
- One-Shot Approaches to Design Optimzation
- Quantifying Retardation in Simulation Based Optimization
- Algorithms for PDE-constrained optimization
- Reduced quasi-Newton method for simultaneous design and optimization
- Fast solvers for optimal control problems from pattern formation
- Numerical solution of KKT systems in PDE-constrained optimization problems via the affine scaling trust-region approach
- Efficient shape optimization for certain and uncertain aerodynamic design
- Layer-Parallel Training of Deep Residual Neural Networks
- Low-Rank Solution to an Optimization Problem Constrained by the Navier--Stokes Equations
This page was built for publication: Approximate nullspace iterations for KKT systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3053124)
