Numerical solution for sparse PDE constrained optimization
From MaRDI portal
Publication:6606456
DOI10.1007/978-3-030-98661-2_129zbMATH Open1548.65339MaRDI QIDQ6606456
Publication date: 16 September 2024
ADMMfinite elementsparsityPDE-constrained optimizationsymmetric Gauss-Seidel accelerated block coordinate descent
Numerical optimization and variational techniques (65K10) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) PDE constrained optimization (numerical aspects) (49M41)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- Approximation of sparse controls in semilinear equations by piecewise linear functions
- A mesh-independence result for semismooth Newton methods.
- Iterative thresholding for sparse approximations
- Approximation of a class of optimal control problems with order of convergence estimates
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Elliptic optimal control problems with \(L^1\)-control cost and applications for the placement of control devices
- Using piecewise linear functions in the numerical approximation of semilinear elliptic control problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Preconditioning PDE-constrained optimization with \(L^1\)-sparsity and control constraints
- A variational discretization concept in control constrained optimization: The linear-quadratic case
- An efficient inexact ABCD method for least squares semidefinite programming
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- Preconditioned Conjugate Gradient Method for Optimal Control Problems with Control and State Constraints
- A duality-based approach to elliptic control problems in non-reflexive Banach spaces
- Approximation of Elliptic Control Problems in Measure Spaces with Sparse Solutions
- Convergence and regularization results for optimal control problems with sparsity functional
- Error estimates for linear-quadratic control problems with control constraints
- Optimization with PDE Constraints
- Realistic Eigenvalue Bounds for the Galerkin Mass Matrix
- On the approximation of the solution of an optimal control problem governed by an elliptic equation
- Primal-Dual Strategy for Constrained Optimal Control Problems
- Semismooth Newton Methods for Operator Equations in Function Spaces
- Superconvergence Properties of Optimal Control Problems
- Optimality Conditions and Error Analysis of Semilinear Elliptic Control Problems with $L^1$ Cost Functional
- Quasi-Interpolation and A Posteriori Error Analysis in Finite Element Methods
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
This page was built for publication: Numerical solution for sparse PDE constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606456)