Publication:4681451
From MaRDI portal
zbMath1109.65056MaRDI QIDQ4681451
Publication date: 23 June 2005
convex optimization; iterative algorithms; cutting plane; subgradient; convex feasibility problem; outer approximations; quadric constraint; signal and image processings
65K05: Numerical mathematical programming methods
90C25: Convex programming
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
94A08: Image processing (compression, reconstruction, etc.) in information and communication theory
Related Items
On Subgradient Projectors, Subgradient projectors: extensions, theory, and characterizations, Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings