Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy
From MaRDI portal
Publication:6076867
DOI10.1137/21m1465913arXiv2112.08886OpenAlexW4387602064MaRDI QIDQ6076867
Emanuel Laude, Andreas Themelis, Panagiotis Patrinos
Publication date: 17 October 2023
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.08886
Numerical methods involving duality (49M29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The NSLUC property and Klee envelope
- The Moreau envelope function and proximal mapping in the sense of the Bregman distance
- On Chebyshev functions and Klee functions
- Bregman distances and Klee sets
- Bregman distances and Chebyshev sets
- Optimal complexity and certification of Bregman first-order methods
- Global convergence of model function based Bregman proximal minimization algorithms
- Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
- The Moreau envelope function and proximal mapping with respect to the Bregman distances in Banach spaces
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Chebyshev Sets, Klee Sets, and Chebyshev Centers with Respect to Bregman Distances: Recent Results and Open Problems
- A General Formula on the Conjugate of the Difference of Functions
- An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
- On $\Phi $-Convexity in Extremal Problems
- Variational Analysis
- Regularizing with Bregman--Moreau Envelopes
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields
- Zero duality gap conditions via abstract convexity
- The Bregman Proximal Average
- The attainment set of the $\varphi$-envelope and genericity properties
- ENVELOPES FOR SETS AND FUNCTIONS: REGULARIZATION AND GENERALIZED CONJUGACY
- Convex Analysis
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima
- Dual Space Preconditioning for Gradient Descent
- Convex analysis and monotone operator theory in Hilbert spaces
- Optimal Transport
This page was built for publication: Dualities for Non-Euclidean Smoothness and Strong Convexity under the Light of Generalized Conjugacy
