An iDCA with sieving strategy for PDE-constrained optimization problems with $L^{1-2}$-control cost (Q6200957): Difference between revisions

Latest revision as of 19:24, 30 December 2024

scientific article; zbMATH DE number 7823278

Language	Label	Description	Also known as
English	An iDCA with sieving strategy for PDE-constrained optimization problems with $L^{1-2}$-control cost	scientific article; zbMATH DE number 7823278

Statements

instance of

scholarly article

0 references

title

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

0 references

published in

Journal of Scientific Computing

0 references

publication date

25 March 2024

0 references

zbMATH Keywords

PDE-constrained optimization problems

0 references

$L^{1-2}$-norm

0 references

sparsity

0 references

S-iDCA

0 references

KŁ property

0 references

MaRDI profile type

Publication

0 references

cites work

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Primal-dual strategy for state-constrained optimal control problems

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

Approximation of sparse controls in semilinear equations by piecewise linear functions

0 references

Optimality Conditions and Error Analysis of Semilinear Elliptic Control Problems with $L^1$ Cost Functional

0 references

An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming

0 references

A duality-based approach to elliptic control problems in non-reflexive Banach spaces

0 references

An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming

0 references

A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications

0 references

Hankel Matrix Rank Minimization with Applications to System Identification and Realization

0 references

The Primal-Dual Active Set Strategy as a Semismooth Newton Method

0 references

Optimization with PDE Constraints

0 references

Lagrange Multiplier Approach to Variational Problems and Applications

0 references

An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP

0 references

On gradients of functions definable in o-minimal structures

0 references

A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions

0 references

QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming

0 references

Q5643297

0 references

Fast L1-L2 minimization via a proximal operator

0 references

Smooth minimization of non-smooth functions

0 references

Distributed optimization and statistical learning for large-scale penalized expectile regression

0 references

A new approximation of the Schur complement in preconditioners for PDE-constrained optimization

0 references

Preconditioning PDE-constrained optimization with $L^1$-sparsity and control constraints

0 references

A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations

0 references

A two‐phase strategy for control constrained elliptic optimal control problems

0 references

An FE-inexact heterogeneous ADMM for elliptic optimal control problems with $L^1$-control cost

0 references

Elliptic optimal control problems with $L^1$-control cost and applications for the placement of control devices

0 references

Convex analysis approach to d. c. programming: Theory, algorithms and applications

0 references

A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem

0 references

Q3780016

0 references

Numerical solution for optimization over the efficient set by d.c. optimization algorithms

0 references

A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems

0 references

Q3161693

0 references

Semismooth Newton Methods for Operator Equations in Function Spaces

0 references

Q5198964

0 references

Q3141900

0 references

Convergence and regularization results for optimal control problems with sparsity functional

0 references

Minimization of $\ell_{1-2}$ for Compressed Sensing

0 references

Analysis of iterative methods for saddle point problems: a unified approach

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1007/S10915-024-02489-2

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6200957

@@ Property / DOI @@
-.1007/s10915-024-02489-2
@@ Property / DOI: 10.1007/s10915-024-02489-2 / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S10915-024-02489-2
@@ Property / DOI: 10.1007/S10915-024-02489-2 / rank @@
+Normal rank

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

Latest revision as of 19:24, 30 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)