ADMM for multiaffine constrained optimization (Q5210740)

scientific article; zbMATH DE number 7154510

Language	Label	Description	Also known as
English	ADMM for multiaffine constrained optimization	scientific article; zbMATH DE number 7154510

Statements

instance of

scholarly article

0 references

title

ADMM for multiaffine constrained optimization (English)

0 references

0 references

0 references

0 references

Optimization Methods and Software

0 references

publication date

21 January 2020

0 references

full work available at URL

https://arxiv.org/abs/1802.09592

0 references

zbMATH Keywords

ADMM

0 references

nonconvex optimization

0 references

multilinear functions

0 references

describes a project that uses

SDPLR

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

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

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence

0 references

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

0 references

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

0 references

Robust principal component analysis?

0 references

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

0 references

A note on the convergence of ADMM for linearly constrained convex optimization problems

0 references

An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming

0 references

On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions

0 references

A three-operator splitting scheme and its optimization applications

0 references

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

0 references

Adapting Regularized Low-Rank Models for Parallel Architectures

0 references

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

0 references

Q3466913

0 references

Hankel Matrix Rank Minimization with Applications to System Identification and Realization

0 references

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

0 references

Q4144736

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

A note on the alternating direction method of multipliers

0 references

Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems

0 references

Directional derivative of the marginal function in nonlinear programming

0 references

Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis

0 references

Alternating direction method of multipliers for real and complex polynomial optimization models

0 references

Reducibility among Combinatorial Problems

0 references

Learning the parts of objects by non-negative matrix factorization

0 references

Global Convergence of Splitting Methods for Nonconvex Composite Optimization

0 references

A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block

0 references

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

0 references

A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions

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

Global convergence of unmodified 3-block ADMM for a class of convex minimization problems

0 references

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

0 references

Splitting Algorithms for the Sum of Two Nonlinear Operators

0 references

Implications of the constant rank constraint qualification

0 references

Q2896018

0 references

Smooth minimization of non-smooth functions

0 references

Cubic regularization of Newton method and its global performance

0 references

Variational Analysis

0 references

Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting

0 references

On the Linear Convergence of the ADMM in Decentralized Consensus Optimization

0 references

A Really Simple Elementary Proof of the Uniform Boundedness Theorem

0 references

A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints

0 references

Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture

0 references

Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method

0 references

Improved proximal ADMM with partially parallel splitting for multi-block separable convex programming

0 references

An algorithm twisted from generalized ADMM for multi-block separable convex minimization models

0 references

Global convergence of ADMM in nonconvex nonsmooth optimization

0 references

An alternating direction algorithm for matrix completion with nonnegative factors

0 references

Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis

0 references

Identifiers

zbMATH Open document ID

1428.90132

0 references

DOI

10.1080/10556788.2019.1683553

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5210740