Polar Convolution

DOI10.1137/18M1209088zbMath1421.90094arXiv1808.07155OpenAlexW2888358248MaRDI QIDQ5231669

Ting Kei Pong, Michael P. Friedlander, Ives MacÊdo

Publication date: 27 August 2019

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

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

zbMATH Keywords

proximal algorithmsgauge optimizationmax convolution

Mathematics Subject Classification ID

Convex programming (90C25) Stochastic programming (90C15)

Related Items (2)

The projected polar proximal point algorithm converges globally ⋮ Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints

Uses Software

• PDCO
• TFOCS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• On the convergence properties of the projected gradient method for convex optimization
• Perspective functions: properties, constructions, and examples
• Templates for convex cone problems with applications to sparse signal recovery
• Atomic Decomposition by Basis Pursuit
• Smoothing and First Order Methods: A Unified Framework
• Variational Analysis
• On a convolution operation obtained by adding level sets : classical and new results
• Gauge Optimization and Duality
• Foundations of Gauge and Perspective Duality
• Convex Analysis
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Polar Convolution