Dual gradient method with partial regularization for convex optimization problems
From MaRDI portal
Cites work
- A simple adaptive step-size choice for iterative optimization methods
- Convex optimization problems with arbitrary right-hand side perturbations
- Decomposition approaches for constrained spatial auction market problems
- Equilibrium programming: Proximal methods
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 3864992 (Why is no real title available?)
- scientific article; zbMATH DE number 3828663 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3726082 (Why is no real title available?)
- scientific article; zbMATH DE number 193878 (Why is no real title available?)
- scientific article; zbMATH DE number 3486541 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 679861 (Why is no real title available?)
- scientific article; zbMATH DE number 3249572 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- Max-norm optimization for robust matrix recovery
- PROJECTIVE STRUCTURES, FLAT BUNDLES, AND KÄHLER METRICS ON MODULI SPACES
- Regularization of the min-max problems occurring in convex programming
This page was built for publication: Dual gradient method with partial regularization for convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7345952)