An efficient duality-based approach for PDE-constrained sparse optimization
From MaRDI portal
Publication:1744892
Abstract: In this paper, elliptic optimal control problems involving the -control cost (-EOCP) is considered. To numerically discretize -EOCP, the standard piecewise linear finite element is employed. However, different from the finite dimensional -regularization optimization, the resulting discrete -norm does not have a decoupled form. A common approach to overcome this difficulty is employing a nodal quadrature formula to approximately discretize the -norm. It is clear that this technique will incur an additional error. To avoid the additional error, solving -EOCP via its dual, which can be reformulated as a multi-block unconstrained convex composite minimization problem, is considered. Motivated by the success of the accelerated block coordinate descent (ABCD) method for solving large scale convex minimization problems in finite dimensional space, we consider extending this method to -EOCP. Hence, an efficient inexact ABCD method is introduced for solving -EOCP. The design of this method combines an inexact 2-block majorized ABCD and the recent advances in the inexact symmetric Gauss-Seidel (sGS) technique for solving a multi-block convex composite quadratic programming whose objective contains a nonsmooth term involving only the first block. The proposed algorithm (called sGS-imABCD) is illustrated at two numerical examples. Numerical results not only confirm the finite element error estimates, but also show that our proposed algorithm is more efficient than (a) the ihADMM (inexact heterogeneous alternating direction method of multipliers), (b) the APG (accelerated proximal gradient) method.
Recommendations
- Error estimates for sparse optimal control problems by piecewise linear finite element approximation
- An FE-inexact heterogeneous ADMM for elliptic optimal control problems with \(L^1\)-control cost
- PDE-constrained optimization: optimal control with \(L_1\)-regularization, state and control box constraints
- Preconditioning PDE-constrained optimization with \(L^1\)-sparsity and control constraints
- Convergence and regularization results for optimal control problems with sparsity functional
Cites work
- scientific article; zbMATH DE number 3716008 (Why is no real title available?)
- scientific article; zbMATH DE number 1984089 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
- A duality-based approach to elliptic control problems in non-reflexive Banach spaces
- A mesh-independence result for semismooth Newton methods.
- A variational discretization concept in control constrained optimization: The linear-quadratic case
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- An efficient inexact ABCD method for least squares semidefinite programming
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
- Approximation of a class of optimal control problems with order of convergence estimates
- Approximation of elliptic control problems in measure spaces with sparse solutions
- Approximation of sparse controls in semilinear equations by piecewise linear functions
- Chebyshev semi-iteration in preconditioning for problems including the mass matrix
- Convergence and regularization results for optimal control problems with sparsity functional
- Elliptic optimal control problems with \(L^1\)-control cost and applications for the placement of control devices
- Error estimates for linear-quadratic control problems with control constraints
- Finite elements and fast iterative solvers. With applications in incompressible fluid dynamics
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Hankel matrix rank minimization with applications to system identification and realization
- Iterative thresholding for sparse approximations
- On the approximation of the solution of an optimal control problem governed by an elliptic equation
- Optimal solvers for PDE-constrained optimization
- Optimality conditions and error analysis of semilinear elliptic control problems with \(L^1\) cost functional
- Optimization with PDE Constraints
- Preconditioned Conjugate Gradient Method for Optimal Control Problems with Control and State Constraints
- Preconditioned MHSS iteration methods for a class of block two-by-two linear systems with applications to distributed control problems
- Preconditioning PDE-constrained optimization with \(L^1\)-sparsity and control constraints
- Primal-Dual Strategy for Constrained Optimal Control Problems
- Realistic Eigenvalue Bounds for the Galerkin Mass Matrix
- Semismooth Newton Methods for Operator Equations in Function Spaces
- Superconvergence Properties of Optimal Control Problems
- Using piecewise linear functions in the numerical approximation of semilinear elliptic control problems
Cited in
(10)- Smoothing Analysis of Two Robust Multigrid Methods for Elliptic Optimal Control Problems
- Preconditioning for PDE-constrained optimization with total variation regularization
- An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost
- Numerical solution for sparse PDE constrained optimization
- A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
- An FE-inexact heterogeneous ADMM for elliptic optimal control problems with \(L^1\)-control cost
- A global convergent semi-smooth Newton method for semi-linear elliptic optimal control problem
- Error estimates for sparse optimal control problems by piecewise linear finite element approximation
- A diagonal finite element-projection-proximal gradient algorithm for elliptic optimal control problem
- Inexact primal-dual active set iteration for optimal distribution control of stationary heat or cold source
This page was built for publication: An efficient duality-based approach for PDE-constrained sparse optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744892)
