An efficient duality-based approach for PDE-constrained sparse optimization
From MaRDI portal
Publication:1744892
DOI10.1007/s10589-017-9951-4zbMath1388.49037arXiv1708.09094OpenAlexW2963740496MaRDI QIDQ1744892
Bo Chen, Xiaoliang Song, Bo Yu
Publication date: 20 April 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.09094
Numerical methods involving duality (49M29) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Discrete approximations in optimal control (49M25) Large-scale systems (93A15) Distributed algorithms (68W15) Linear optimal control problems (49N05)
Related Items
Smoothing Analysis of Two Robust Multigrid Methods for Elliptic Optimal Control Problems ⋮ A global convergent semi-smooth Newton method for semi-linear elliptic optimal control problem ⋮ Preconditioning for PDE-constrained optimization with total variation regularization ⋮ A diagonal finite element-projection-proximal gradient algorithm for elliptic optimal control problem ⋮ A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Chebyshev semi-iteration in preconditioning for problems including the mass matrix
- 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
- Finite Elements and Fast Iterative Solvers
- Optimal Solvers for PDE-Constrained Optimization
- 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
- An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
- Preconditioned MHSS iteration methods for a class of block two-by-two linear systems with applications to distributed control problems
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
