An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost

DOI10.1007/s10915-024-02489-2MaRDI QIDQ6200957

No author found.

Publication date: 25 March 2024

Published in: Journal of Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

sparsityPDE-constrained optimization problems\(L^{1-2}\)-normKŁ propertyS-iDCA

Mathematics Subject Classification ID

Existence theories for optimal control problems involving partial differential equations (49J20) Mathematical programming (90Cxx) Distributed algorithms (68W15) Error analysis and interval analysis (65G99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Smooth minimization of non-smooth functions
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth 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
• Elliptic optimal control problems with \(L^1\)-control cost and applications for the placement of control devices
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• On gradients of functions definable in o-minimal structures
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Primal-dual strategy for state-constrained optimal control problems
• Preconditioning PDE-constrained optimization with \(L^1\)-sparsity and control constraints
• QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
• Fast L1-L2 minimization via a proximal operator
• An FE-inexact heterogeneous ADMM for elliptic optimal control problems with \(L^1\)-control cost
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Distributed optimization and statistical learning for large-scale penalized expectile regression
• An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• Analysis of iterative methods for saddle point problems: a unified approach
• A new approximation of the Schur complement in preconditioners for PDE-constrained optimization
• Hankel Matrix Rank Minimization with Applications to System Identification and Realization
• A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
• A duality-based approach to elliptic control problems in non-reflexive Banach spaces
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Convergence and regularization results for optimal control problems with sparsity functional
• A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
• Lagrange Multiplier Approach to Variational Problems and Applications
• Optimization with PDE Constraints
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Semismooth Newton Methods for Operator Equations in Function Spaces
• The Primal-Dual Active Set Strategy as a Semismooth Newton Method
• A two‐phase strategy for control constrained elliptic 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
• Minimization of $\ell_{1-2}$ for Compressed Sensing
• A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions

This page was built for publication: An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost