Perturbed Fenchel duality and first-order methods
type: Item
instance of: scholarly article
title: Perturbed Fenchel duality and first-order methods
author: David H. Gutman
author: Javier Peña
published in: Mathematical Programming. Series A. Series B
publication date: 2023-03-01T00:00:00Z
full work available at URL: https://arxiv.org/abs/1812.10198
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 7658255
MaRDI profile type: Publication
OpenAlex ID: W4210755813
cites work: Duality Between Subgradient and Conditional Gradient Methods
cites work: A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: First-Order Methods in Optimization
cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization.
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
cites work: Convex analysis and nonlinear optimization. Theory and examples
cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
cites work: The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods
cites work: An Optimal First Order Method Based on Optimal Quadratic Averaging
cites work: New analysis and results for the Frank-Wolfe method
cites work: Convergence Rates of Proximal Gradient Methods via the Convex Conjugate
cites work: Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
cites work: Q3141900
cites work: Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
cites work: Relatively Smooth Convex Optimization by First-Order Methods, and Applications
cites work: Q3967358
cites work: Smooth minimization of non-smooth functions
cites work: Gradient methods for minimizing composite functions
cites work: Universal gradient methods for convex optimization problems
cites work: Complexity bounds for primal-dual methods minimizing the model of objective function
cites work: Convergence of first-order methods via the convex conjugate
cites work: Convex Analysis
cites work: Variable quasi-Bregman monotone sequences
cites work: Forward-backward splitting with Bregman distances
DOI: 10.1007/S10107-022-01779-7
description: scientific article; zbMATH DE number 7658255