Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization

DOI10.1137/19M1240460zbMath1450.65054arXiv1901.01287MaRDI QIDQ4971021

Cesare Molinari, Antonio Silveti-Falls, Jalal Fadili

Publication date: 8 October 2020

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

augmented LagrangianMoreau envelopeproximal mappingcomposite minimizationconditional gradient

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52)

Related Items (4)

Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution ⋮ Smooth over-parameterized solvers for non-smooth structured optimization ⋮ Provable Phase Retrieval with Mirror Descent ⋮ Scalable Semidefinite Programming

Uses Software

• NESUN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditional gradient algorithms for norm-regularized smooth convex optimization
• Universal gradient methods for convex optimization problems
• A generalized conditional gradient method and its connection to an iterative shrinkage method
• Conditional gradient algorithms with open loop step size rules
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• A conditional gradient method with linear rate of convergence for solving convex linear systems
• Complexity bounds for primal-dual methods minimizing the model of objective function
• A general formula for the horizon function of a convex composite function
• Convergence rates of forward-Douglas-Rachford splitting method
• Convergence and approximation of semigroups of nonlinear operators in Banach spaces
• A Generalized Forward-Backward Splitting
• Convex Optimization in Normed Spaces
• Duality Between Subgradient and Conditional Gradient Methods
• The Cyclic Block Conditional Gradient Method for Convex Optimization Problems
• Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
• Variational Analysis
• Practical Sketching Algorithms for Low-Rank Matrix Approximation
• Model selection with low complexity priors
• An Historical Survey of Computational Methods in Optimal Control
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization