The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming (Q4967363): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 15:28, 30 December 2024

scientific article; zbMATH DE number 7076167

Language	Label	Description	Also known as
English	The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming	scientific article; zbMATH DE number 7076167

Statements

scholarly article

0 references

The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming (English)

0 references

0 references

0 references

The SMAI journal of computational mathematics

0 references

publication date

3 July 2019

0 references

full work available at URL

http://www.numdam.org/item?id=SMAI-JCM_2018__4__81_0/

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

Entropic proximal decomposition methods for convex programs and variational inequalities

0 references

Interior projection-like methods for monotone variational inequalities

0 references

A logarithmic-quadratic proximal method for variational inequalities

0 references

0 references

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

0 references

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

0 references

Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization

0 references

Proximal Splitting Methods in Signal Processing

0 references

Convergence Rate Analysis of Several Splitting Schemes

0 references

Parallel multi-block ADMM with \(o(1/k)\) convergence

0 references

On the basic theorem of complementarity

0 references

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

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

0 references

On Alternating Direction Methods of Multipliers: A Historical Perspective

0 references

0 references

0 references

Modified Lagrangians in convex programming and their generalizations

0 references

An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing

0 references

Deblurring Images

0 references

On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming

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

On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM

0 references

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

0 references

On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers

0 references

On the linear convergence of the alternating direction method of multipliers

0 references

Inexact alternating direction methods of multipliers with logarithmic-quadratic proximal regularization

0 references

A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization

0 references

A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming

0 references

On the Global Linear Convergence of the ADMM with MultiBlock Variables

0 references

On the sublinear convergence rate of multi-block ADMM

0 references

0 references

0 references

Gradient methods for minimizing composite functions

0 references

A survey on the continuous nonlinear resource allocation problem

0 references

0 references

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

0 references

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

0 references

On the $O(1/t)$ Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization

0 references

Market Mechanisms and Mathematical Programming

0 references

An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.5802/SMAI-JCM.30

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4967363

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4967363&oldid=39499686"