A sequential complete inertial Bregman ADMM for multi-block nonconvex problems (Q7312900)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

A sequential complete inertial Bregman ADMM for multi-block nonconvex problems

scientific article; zbMATH DE number 8238737

Language	Label	Description	Also known as
default for all languages	No label defined
English	A sequential complete inertial Bregman ADMM for multi-block nonconvex problems	scientific article; zbMATH DE number 8238737

Statements

instance of

scholarly article

0 references

title

A sequential complete inertial Bregman ADMM for multi-block nonconvex problems (English)

0 references

0 references

0 references

0 references

Journal of Applied Analysis and Computation

0 references

publication date

12 August 2026

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q4450552

0 references

Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space

0 references

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

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

Inertial proximal ADMM for linearly constrained separable convex optimization

0 references

Distributed optimal capacity allocation of integrated energy system via modified ADMM

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables

0 references

A dual algorithm for the solution of nonlinear variational problems via finite element approximation

0 references

A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems

0 references

Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems

0 references

An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization

0 references

Convergence of ADMM for multi-block nonconvex separable optimization models

0 references

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

0 references

Convergence study on the symmetric version of ADMM with larger step sizes

0 references

Alternating direction method with Gaussian back substitution for separable convex programming

0 references

A splitting method for separable convex programming

0 references

Inertial alternating direction method of multipliers for non-convex non-smooth optimization

0 references

Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems

0 references

A partially symmetric linearized Bregman ADMM for three-block nonconvex nonsmooth optimization

0 references

Q5040316

0 references

A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization

0 references

Global convergence of splitting methods for nonconvex composite optimization

0 references

LINEARIZED ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR SEPARABLE CONVEX OPTIMIZATION OF REAL FUNCTIONS IN COMPLEX DOMAIN

0 references

A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization

0 references

A generalized alternating direction method of multipliers for tensor complementarity problems

0 references

Convergence analysis on the alternating direction method of multipliers for the cosparse optimization problem

0 references

Introductory lectures on convex optimization. A basic course.

0 references

iPiasco: inertial proximal algorithm for strongly convex optimization

0 references

iPiano: inertial proximal algorithm for nonconvex optimization

0 references

Alternated multi-step inertial iterative algorithm for solving the split feasibility problem in Hilbert spaces

0 references

LOW-RANK AND SPARSE MATRIX RECOVERY FROM NOISY OBSERVATIONS VIA 3-BLOCK ADMM ALGORITHM

0 references

An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications

0 references

Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems

0 references

General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems

0 references

Outlier-Robust PCA: The High-Dimensional Case

0 references

An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization

0 references

A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications

0 references

Identifiers

DOI

10.11948/20250166

0 references

Mathematics Subject Classification ID

90C25

0 references

zbMATH DE Number

8238737

0 references

Sitelinks

Mathematics(1 entry)

mardi A sequential complete inertial Bregman ADMM for multi-block nonconvex problems