An alternate minimization method beyond positive definite proximal regularization: convergence and complexity (Q5244153): Difference between revisions

Latest revision as of 16:30, 30 December 2024

scientific article; zbMATH DE number 7133194

Language	Label	Description	Also known as
English	An alternate minimization method beyond positive definite proximal regularization: convergence and complexity	scientific article; zbMATH DE number 7133194

Statements

instance of

scholarly article

0 references

title

An alternate minimization method beyond positive definite proximal regularization: convergence and complexity (English)

0 references

0 references

0 references

0 references

0 references

Journal of Nonlinear and Variational Analysis

0 references

publication date

20 November 2019

0 references

zbMATH Keywords

alternate minimization method

0 references

convex optimization

0 references

complexity

0 references

positive-indefinite proximal regularization

0 references

variational inequality

0 references

describes a project that uses

RecPF

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.23952/jnva.3.2019.3.08

0 references

cites work

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

0 references

Alternating Direction Method for Image Inpainting in Wavelet Domains

0 references

Asynchronous Distributed ADMM for Large-Scale Optimization—Part II: Linear Convergence Analysis and Numerical Performance

0 references

Auxiliary principle and algorithm for mixed equilibrium problems and bilevel mixed equilibrium problems in Banach spaces

0 references

Q3038523

0 references

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

0 references

Q4144736

0 references

A note on the alternating direction method of multipliers

0 references

An ADM-based splitting method for separable convex programming

0 references

A new inexact alternating directions method for monotone variational inequalities

0 references

A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming

0 references

On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method

0 references

Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes

0 references

Multiplier and gradient methods

0 references

Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning

0 references

A decomposition property for a class of square matrices

0 references

Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods

0 references

Q5590418

0 references

Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming

0 references

A New Alternating Minimization Algorithm for Total Variation Image Reconstruction

0 references

Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization

0 references

A unified primal-dual algorithm framework based on Bregman iteration

0 references

Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities

0 references

Strong convergence of an extragradient-like algorithm involving pseudo-monotone mappings

0 references

Identifiers

zbMATH Open document ID

1475.90116

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.23952/JNVA.3.2019.3.08

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5244153

@@ Property / DOI @@
-.23952/jnva.3.2019.3.08
@@ Property / DOI: 10.23952/jnva.3.2019.3.08 / rank @@
-Normal rank
@@ Property / DOI @@
+.23952/JNVA.3.2019.3.08
@@ Property / DOI: 10.23952/JNVA.3.2019.3.08 / rank @@
+Normal rank