Interior‐point methods and preconditioning for PDE‐constrained optimization problems involving sparsity terms

DOI10.1002/nla.2276OpenAlexW2996447514WikidataQ114696216 ScholiaQ114696216MaRDI QIDQ5218986

Martin Stoll, Margherita Porcelli, John W. Pearson

Publication date: 6 March 2020

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.05896

zbMATH Keywords

preconditioningbox constraintsinterior-point methodssparsityPDE-constrained optimizationsaddle-point systems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Control/observation systems governed by partial differential equations (93C20) Iterative numerical methods for linear systems (65F10) Flow control and optimization for incompressible viscous fluids (76D55) Preconditioners for iterative methods (65F08)

Related Items (12)

On the implementation of a quasi-Newton interior-point method for PDE-constrained optimization using finite element discretizations ⋮ Smoothing Analysis of Two Robust Multigrid Methods for Elliptic Optimal Control Problems ⋮ A reverse augmented constraint preconditioner for Lagrange multiplier methods in contact mechanics ⋮ Improved penalty algorithm for mixed integer PDE constrained optimization problems ⋮ Preconditioning for PDE-constrained optimization with total variation regularization ⋮ General-purpose preconditioning for regularized interior point methods ⋮ Preconditioning of discrete state- and control-constrained optimal control convection-diffusion problems ⋮ A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization ⋮ PDE-Constrained Optimization: Optimal control with L 1-Regularization, State and Control Box Constraints ⋮ Block preconditioners for linear systems in interior point methods for convex constrained optimization ⋮ GUDERMANNIAN NEURAL NETWORKS TO INVESTIGATE THE LIÉNARD DIFFERENTIAL MODEL ⋮ An improved penalty algorithm using model order reduction for MIPDECO problems with partial observations

This page was built for publication: Interior‐point methods and preconditioning for PDE‐constrained optimization problems involving sparsity terms