Excessive Gap Technique in Nonsmooth Convex Minimization
type: Item
instance of: scholarly article
title: Excessive Gap Technique in Nonsmooth Convex Minimization
zbMATH Open document ID: 1096.90026
DOI: 10.1137/S1052623403422285
published in: SIAM Journal on Optimization
publication date: 2005-09-16T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 46N10
Mathematics Subject Classification ID: 47N40
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 2206236
zbMATH Keywords: convex optimization
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: complexity theory
zbMATH Keywords: black-box oracle
zbMATH Keywords: optimal methods
zbMATH Keywords: structural optimization
MaRDI profile type: Publication
full work available at URL: s1052623403422285
OpenAlex ID: W2000955051
Recommended article: Q6067922
Recommended article: On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
Recommended article: Strong convergence in Hilbert spaces via \(\varGamma \)-duality
Recommended article: A relaxed version of Bregman's method for convex programming
Recommended article: Bregman three-operator splitting methods
Recommended article: An optimal randomized incremental gradient method
Recommended article: A class of convergent primal-dual subgradient algorithms for decomposable convex programs
Recommended article: Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
Recommended article: Dual convergence of the proximal point method with Bregman distances for linear programming
Recommended article: Convergence analysis of approximate primal solutions in dual first-order methods
description: scientific article; zbMATH DE number 2206236