A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization (Q4600841)

scientific article; zbMATH DE number 6826865

Language	Label	Description	Also known as
English	A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization	scientific article; zbMATH DE number 6826865

Statements

instance of

scholarly article

0 references

title

A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization (English)

0 references

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

17 January 2018

0 references

full work available at URL

https://arxiv.org/abs/1507.06243

0 references

zbMATH Keywords

gap reduction technique

0 references

first-order primal-dual methods

0 references

augmented Lagrangian

0 references

smoothing techniques

0 references

homotopy

0 references

separable convex minimization

0 references

parallel and distributed computation

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q4091727

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Smoothing and First Order Methods: A Unified Framework

0 references

A fast dual proximal gradient algorithm for convex minimization and applications

0 references

Square-root lasso: pivotal recovery of sparse signals via conic programming

0 references

Lectures on Modern Convex Optimization

0 references

Q4001523

0 references

Q3690580

0 references

A variable smoothing algorithm for solving convex optimization problems

0 references

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

0 references

Q4821526

0 references

A first-order primal-dual algorithm for convex problems with applications to imaging

0 references

The convex geometry of linear inverse problems

0 references

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

0 references

A proximal-based deomposition method for compositions method for convex minimization problems

0 references

Optimal Primal-Dual Methods for a Class of Saddle Point Problems

0 references

Proximal Splitting Methods in Signal Processing

0 references

Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators

0 references

A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms

0 references

Convergence Rate Analysis of Primal-Dual Splitting Schemes

0 references

Convergence Rate Analysis of the Forward-Douglas-Rachford Splitting Scheme

0 references

Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions

0 references

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

0 references

On the global and linear convergence of the generalized alternating direction method of multipliers

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

Restarting the accelerated coordinate descent method with a rough strong convexity estimate

0 references

Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective

0 references

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

0 references

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

0 references

An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems

0 references

Iteration-complexity of first-order penalty methods for convex programming

0 references

Iteration-complexity of first-order augmented Lagrangian methods 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

A First-Order Primal-Dual Algorithm with Linesearch

0 references

On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean

0 references

Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems

0 references

Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers

0 references

Iteration complexity analysis of dual first-order methods for conic convex programming

0 references

Application of a Smoothing Technique to Decomposition in Convex Optimization

0 references

Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC

0 references

Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Excessive Gap Technique in Nonsmooth Convex Minimization

0 references

Smooth minimization of non-smooth functions

0 references

Dual extrapolation and its applications to solving variational inequalities and related problems

0 references

Q5491447

0 references

Adaptive restart for accelerated gradient schemes

0 references

An Accelerated Linearized Alternating Direction Method of Multipliers

0 references

Variational Analysis

0 references

Convex Analysis

0 references

Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization

0 references

A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator

0 references

Smoothing alternating direction methods for fully nonsmooth constrained convex optimization

0 references

Composite Self-Concordant Minimization

0 references

Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities

0 references

A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators

0 references

Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers

0 references

Identifiers

zbMATH Open document ID

1386.90109

0 references

DOI

10.1137/16M1093094

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4600841