Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming (Q5275290)

scientific article; zbMATH DE number 6741598

Language	Label	Description	Also known as
English	Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming	scientific article; zbMATH DE number 6741598

Statements

instance of

scholarly article

0 references

title

Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming (English)

0 references

0 references

0 references

0 references

SIAM Journal on Numerical Analysis

0 references

publication date

11 July 2017

0 references

zbMATH Keywords

Douglas-Rachford splitting method

0 references

weakly convex penalty

0 references

Fejér monotone

0 references

convergence

0 references

convergence rate

0 references

rate of asymptotic regularity

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Wavelet methods in statistics: some recent developments and their applications

0 references

Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging

0 references

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

0 references

Backward-forward algorithms for structured monotone inclusions in Hilbert spaces

0 references

Q4623257

0 references

Q4894778

0 references

Q4179429

0 references

The composition of projections onto closed convex sets in Hilbert space is asymptotically regular

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

Finding best approximation pairs relative to two closed convex sets in Hilbert spaces

0 references

The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle

0 references

On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces

0 references

On the Range of the Douglas–Rachford Operator

0 references

Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization

0 references

On the order of the operators in the Douglas-Rachford algorithm

0 references

The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces

0 references

On the local convergence of the Douglas-Rachford algorithm

0 references

Linear and strong convergence of algorithms involving averaged nonexpansive operators

0 references

On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty

0 references

Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

Krasnoselski-Mann Iterations in Normed Spaces

0 references

The solution by iteration of nonlinear functional equations in Banach spaces

0 references

Q3976072

0 references

Q4163944

0 references

Semiconcave functions, Hamilton-Jacobi equations, and optimal control

0 references

Iterative methods for fixed point problems in Hilbert spaces

0 references

The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery

0 references

Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization

0 references

Q2768014

0 references

On the rate of convergence of Krasnosel'skiĭ-Mann iterations and their connection with sums of Bernoullis

0 references

A Generalized Proximal Point Algorithm and Its Convergence Rate

0 references

Evolution equations with lack of convexity

0 references

Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit

0 references

Implicit Functions and Solution Mappings

0 references

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

0 references

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

0 references

Nonexpansive Mappings, Asymptotic Regularity and Successive Approximations

0 references

Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

0 references

The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem

0 references

Iteration processes for nonexpansive mappings

0 references

Modified Lagrangians in convex programming and their generalizations

0 references

On the convergence rate of Douglas-Rachford operator splitting method

0 references

Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems

0 references

Fixed Points and Iteration of a Nonexpansive Mapping in a Banach Space

0 references

Metric subregularity and the proximal point method

0 references

Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems

0 references

Peaceman-Rachford splitting for a class of nonconvex optimization problems

0 references

Convergence rates with inexact non-expansive operators

0 references

Local convergence properties of Douglas-Rachford and alternating direction method of multipliers

0 references

Splitting Algorithms for the Sum of Two Nonlinear Operators

0 references

Q5483183

0 references

The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings

0 references

Weak convergence of the sequence of successive approximations for nonexpansive mappings

0 references

The Numerical Solution of Parabolic and Elliptic Differential Equations

0 references

Linear convergence of the Douglas–Rachford method for two closed sets

0 references

Convergence of Krasnoselskii-Mann iterations of nonexpansive operators

0 references

Convex Analysis

0 references

Variational Analysis

0 references

Nonlinear total variation based noise removal algorithms

0 references

Sparse Signal Estimation by Maximally Sparse Convex Optimization

0 references

On Chebyshev functions and Klee functions

0 references

Nearly unbiased variable selection under minimax concave penalty

0 references

Identifiers

zbMATH Open document ID

1368.47038

0 references

DOI

10.1137/16M1078604

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5275290