Hard-constrained inconsistent signal feasibility problems
From MaRDI portal
Publication:2732843
DOI10.1109/78.782189zbMath0979.94016OpenAlexW2115158696MaRDI QIDQ2732843
Patrick L. Combettes, Pascal Bondon
Publication date: 9 August 2001
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/534ee5f69c4f1a24ecd805d1fa6d36d6c9d644b9
convex optimizationHilbert spacemonotone operatorsignal synthesisfeasible signalsinconsistent convex constraints
Numerical optimization and variational techniques (65K10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items
Approximate solutions to variational inequality over the fixed point set of a strongly nonexpansive mapping ⋮ Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings ⋮ Proximal Splitting Methods in Signal Processing ⋮ Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING ⋮ Proximal point algorithms for nonsmooth convex optimization with fixed point constraints ⋮ Riemannian stochastic fixed point optimization algorithm ⋮ Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization ⋮ The augmented Lagrangian method can approximately solve convex optimization with least constraint violation ⋮ Proximal Activation of Smooth Functions in Splitting Algorithms for Convex Image Recovery ⋮ Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems ⋮ Two stochastic optimization algorithms for convex optimization with fixed point constraints ⋮ Optimization for the sum of finite functions over the solution set of split equality optimization problems with applications ⋮ A new modified hybrid steepest-descent by using a viscosity approximation method with a weakly contractive mapping for a system of equilibrium problems and fixed point problems with minimization problems ⋮ Solving monotone inclusions via compositions of nonexpansive averaged operators ⋮ Fixed point quasiconvex subgradient method ⋮ Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping ⋮ Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization ⋮ Optimization for Inconsistent Split Feasibility Problems ⋮ Alternating conditional gradient method for convex feasibility problems ⋮ An MM Algorithm for Split Feasibility Problems ⋮ Decentralized hierarchical constrained convex optimization ⋮ A note on the finite convergence of alternating projections ⋮ The hybrid projection algorithm for finding the common fixed points of nonexpansive mappings and the zeroes of maximal monotone operators in Banach spaces ⋮ The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors ⋮ Split Feasibility and Fixed Point Problems ⋮ A Variational Inequality Model for the Construction of Signals from Inconsistent Nonlinear Equations
