A proximal alternating direction method of multipliers for DC programming with structured constraints (Q6536834)

scientific article; zbMATH DE number 7846591

Language	Label	Description	Also known as
English	A proximal alternating direction method of multipliers for DC programming with structured constraints	scientific article; zbMATH DE number 7846591

Statements

instance of

scholarly article

0 references

title

A proximal alternating direction method of multipliers for DC programming with structured constraints (English)

0 references

0 references

0 references

0 references

Journal of Scientific Computing

0 references

publication date

14 May 2024

0 references

zbMATH Keywords

alternating direction method of multipliers

0 references

DC programming

0 references

nonconvex optimization

0 references

Kurdyka-Łojasiewicz inequality

0 references

Dantzig selector

0 references

MaRDI profile type

Publication

0 references

cites work

Accelerating the DC algorithm for smooth functions

0 references

The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions

0 references

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

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

First-Order Methods in Optimization

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates

0 references

Discovering governing equations from data by sparse identification of nonlinear dynamical systems

0 references

The Dantzig selector: statistical estimation when $p$ is much larger than $n$. (With discussions and rejoinder).

0 references

Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem

0 references

A multiprojection algorithm using Bregman projections in a product space

0 references

A unified Douglas-Rachford algorithm for generalized DC programming

0 references

Functional Analysis, Calculus of Variations and Optimal Control

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

New Restricted Isometry Property Analysis for $\ell_1-\ell_2$ Minimization Methods

0 references

The Dantzig selector: recovery of signal via ℓ <sub>1</sub> − αℓ <sub>2</sub> minimization

0 references

DC formulations and algorithms for sparse optimization problems

0 references

Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints

0 references

Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities

0 references

An implementable splitting algorithm for the $\ell_1$-norm regularized split feasibility problem

0 references

Splitting methods for split feasibility problems with application to Dantzig selectors

0 references

A note on approximating curve with 1-norm regularization method for the split feasibility problem

0 references

Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems

0 references

Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis

0 references

DC programming and DCA: thirty years of developments

0 references

Fast L1-L2 minimization via a proximal operator

0 references

Computing sparse representation in a highly coherent dictionary based on difference of $L_1$ and $L_2$

0 references

Point source super-resolution via non-convex $L_1$ based methods

0 references

A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing

0 references

Structured model selection via ℓ1−ℓ2 optimization

0 references

Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming

0 references

Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization

0 references

Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization

0 references

$l_1$-$l_2$ regularization of split feasibility problems

0 references

Q3780016

0 references

Convex Analysis

0 references

Variational Analysis

0 references

Learning partial differential equations via data discovery and sparse optimization

0 references

Extracting Structured Dynamical Systems Using Sparse Optimization With Very Few Samples

0 references

Alternating direction method of multipliers with difference of convex functions

0 references

Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning

0 references

New Bregman proximal type algoritms for solving DC optimization problems

0 references

A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems

0 references

Global convergence of ADMM in nonconvex nonsmooth optimization

0 references

A proximal difference-of-convex algorithm with extrapolation

0 references

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

0 references

PhaseLiftOff: an accurate and stable phase retrieval method based on difference of trace and Frobenius norms

0 references

The ABC of DC programming

0 references

Identifiers

zbMATH Open document ID

1546.90203

0 references

DOI

10.1007/s10915-024-02550-0

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6536834