scientific article; zbMATH DE number 2182581

zbMath1109.65056MaRDI QIDQ4681451

Isao Yamada, Nobuhiko Ogura

Publication date: 23 June 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convex optimizationiterative algorithmscutting planesubgradientconvex feasibility problemouter approximationsquadric constraintsignal and image processings

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (3)

Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ Subgradient projectors: extensions, theory, and characterizations ⋮ On Subgradient Projectors

This page was built for publication: