An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 14:30, 14 September 2024

scientific article

Language	Label	Description	Also known as
English	An adaptive primal-dual framework for nonsmooth convex minimization	scientific article

Statements

scholarly article

0 references

An adaptive primal-dual framework for nonsmooth convex minimization (English)

0 references

Ahmet Alacaoglu

0 references

0 references

0 references

0 references

Mathematical Programming Computation

0 references

publication date

25 January 2021

0 references

full work available at URL

https://arxiv.org/abs/1808.04648

0 references

zbMATH Keywords

primal-dual first-order methods

0 references

restarting

0 references

augmented Lagrangian

0 references

self-adaptive method

0 references

nonsmooth convex optimization

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

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

0 references

0 references

A variable smoothing algorithm for solving convex optimization problems

0 references

A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems

0 references

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

0 references

Sparse and stable Markowitz portfolios

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

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

0 references

On the ergodic convergence rates of a first-order primal-dual algorithm

0 references

Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions

0 references

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

0 references

Atomic Decomposition by Basis Pursuit

0 references

Proximal Splitting Methods in Signal Processing

0 references

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

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

Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization

0 references

Compressed sensing

0 references

Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming

0 references

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

0 references

First-order algorithms for convex optimization with nonseparable objective and coupled constraints

0 references

0 references

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

0 references

Multiplier and gradient methods

0 references

Proximal Minimization Methods with Generalized Bregman Functions

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

Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis

0 references

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

0 references

Complexity of first-order inexact Lagrangian and penalty 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

0 references

Excessive Gap Technique in Nonsmooth Convex Minimization

0 references

Smooth minimization of non-smooth functions

0 references

Adaptive restart for accelerated gradient schemes

0 references

An Accelerated Linearized Alternating Direction Method of Multipliers

0 references

0 references

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

0 references

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

0 references

Proximal alternating penalty algorithms for nonsmooth constrained convex optimization

0 references

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

0 references

A splitting algorithm for dual monotone inclusions involving cocoercive operators

0 references

Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming

0 references

Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s12532-019-00173-3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2220901

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