Perturbed Fenchel duality and first-order methods

DOI10.1007/s10107-022-01779-7OpenAlexW4210755813MaRDI QIDQ2687051

Publication date: 1 March 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.10198

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Methods of reduced gradient type (90C52)

Related Items (3)

Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant ⋮ No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization ⋮ Local convexity of the TAP free energy and AMP convergence for \(\mathbb{Z}_2\)-synchronization

Cites Work

Unnamed Item
Unnamed Item
Smooth minimization of non-smooth functions
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Gradient methods for minimizing composite functions
Universal gradient methods for convex optimization problems
Variable quasi-Bregman monotone sequences
Convex analysis and nonlinear optimization. Theory and examples
Convergence of first-order methods via the convex conjugate
Complexity bounds for primal-dual methods minimizing the model of objective function
Mirror descent and nonlinear projected subgradient methods for convex optimization.
Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
Forward-backward splitting with Bregman distances
Duality Between Subgradient and Conditional Gradient Methods
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
First-Order Methods in Optimization
An Optimal First Order Method Based on Optimal Quadratic Averaging
Relatively Smooth Convex Optimization by First-Order Methods, and Applications
Convergence Rates of Proximal Gradient Methods via the Convex Conjugate
The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods
Convex Analysis
A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
Convex analysis and monotone operator theory in Hilbert spaces
New analysis and results for the Frank-Wolfe method

This page was built for publication: Perturbed Fenchel duality and first-order methods