A half-proximal symmetric splitting method for non-convex separable optimization (Q6897765)

!

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

A half-proximal symmetric splitting method for non-convex separable optimization

scientific article; zbMATH DE number 8123825

Language	Label	Description	Also known as
default for all languages	No label defined
English	A half-proximal symmetric splitting method for non-convex separable optimization	scientific article; zbMATH DE number 8123825

Statements

instance of

scholarly article

0 references

title

A half-proximal symmetric splitting method for non-convex separable optimization (English)

0 references

0 references

0 references

0 references

0 references

0 references

Acta Mathematica Sinica. English Series

0 references

publication date

19 November 2025

0 references

zbMATH Keywords

nonconvex separable optimization

0 references

half-proximal splitting method

0 references

Kurdyka-Łojasiewicz property

0 references

convergence and rate analyses

0 references

MaRDI profile type

MaRDI publication profile

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

Accelerated symmetric ADMM and its applications in large-scale signal processing

0 references

An inexact accelerated stochastic ADMM for separable convex optimization

0 references

Convergence on a symmetric accelerated stochastic ADMM with larger stepsizes

0 references

A New Insight on Augmented Lagrangian Method with Applications in Machine Learning

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

An inertial proximal alternating direction method of multipliers for nonconvex optimization

0 references

Some notes on the divergence example for multi-block alternating direction method of multipliers

0 references

The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

0 references

A golden ratio proximal alternating direction method of multipliers for separable convex optimization

0 references

A unified algorithmic framework of symmetric Gauss-Seidel decomposition based proximal ADMMs for convex composite programming

0 references

Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor

0 references

An inertial proximal Peaceman-Rachford splitting method

0 references

Comments on: ``Wavelets in statistics: a review'' by A. Antoniadis

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

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

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

A survey on some recent developments of alternating direction method of multipliers

0 references

A note on the alternating direction method of multipliers

0 references

Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities

0 references

A strictly contractive Peaceman-Rachford splitting method for convex programming

0 references

Alternating direction method with Gaussian back substitution for separable convex programming

0 references

A splitting method for separable convex programming

0 references

Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming

0 references

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

0 references

A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA

0 references

Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems

0 references

The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems

0 references

Q5040316

0 references

A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application

0 references

Monotone splitting SQP algorithms for two-block nonconvex optimization problems with general linear constraints and applications

0 references

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

0 references

Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems

0 references

Global convergence of splitting methods for nonconvex composite optimization

0 references

Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval

0 references

An alternating direction method of multipliers for solving user equilibrium problem

0 references

A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization

0 references

A Bregman-style improved ADMM and its linearized version in the nonconvex setting: convergence and rate analyses

0 references

Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure

0 references

Convergence study on the proximal alternating direction method with larger step size

0 references

iPiasco: inertial proximal algorithm for strongly convex optimization

0 references

A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem

0 references

The Numerical Solution of Parabolic and Elliptic Differential Equations

0 references

Nonlinear total variation based noise removal algorithms

0 references

A reliability-based stochastic traffic assignment model for network with multiple user classes under uncertainty in demand

0 references

Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations

0 references

An inertial proximal splitting method with applications

0 references

A New Alternating Minimization Algorithm for Total Variation Image Reconstruction

0 references

A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems

0 references

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

0 references

A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration

0 references

Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing

0 references

Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction

0 references

Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property

0 references

A proximal fully parallel splitting method with a relaxation factor for separable convex programming

0 references

Sparse SAR imaging based on \(L_{1/2}\) regularization

0 references

An extended proximal ADMM algorithm for three-block nonconvex optimization problems

0 references

An inertial semi-forward-reflected-backward splitting and its application

0 references

Identifiers

DOI

10.1007/S10114-025-4144-Z

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi A half-proximal symmetric splitting method for non-convex separable optimization