Pages that link to "Item:Q2732843"

The following pages link to Hard-constrained inconsistent signal feasibility problems (Q2732843):

Displaying 28 items.

• An MM Algorithm for Split Feasibility Problems (Q150985) (← links)
• Approximate solutions to variational inequality over the fixed point set of a strongly nonexpansive mapping (Q286844) (← links)
• Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings (Q288530) (← links)
• Proximal point algorithms for nonsmooth convex optimization with fixed point constraints (Q323195) (← links)
• 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 (Q696010) (← links)
• Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization (Q737229) (← links)
• Optimization for the sum of finite functions over the solution set of split equality optimization problems with applications (Q1730395) (← links)
• Alternating conditional gradient method for convex feasibility problems (Q2044579) (← links)
• A note on the finite convergence of alternating projections (Q2060563) (← links)
• The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors (Q2084269) (← links)
• Riemannian stochastic fixed point optimization algorithm (Q2159421) (← links)
• Fixed point quasiconvex subgradient method (Q2282530) (← links)
• Decentralized hierarchical constrained convex optimization (Q2303528) (← links)
• Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping (Q2515036) (← links)
• Optimization for Inconsistent Split Feasibility Problems (Q2805985) (← links)
• Proximal Splitting Methods in Signal Processing (Q2897282) (← links)
• Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings (Q2897289) (← links)
• NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING (Q4546050) (← links)
• Solving monotone inclusions via compositions of nonexpansive averaged operators (Q4669785) (← links)
• A Variational Inequality Model for the Construction of Signals from Inconsistent Nonlinear Equations (Q5024382) (← links)
• Proximal Activation of Smooth Functions in Splitting Algorithms for Convex Image Recovery (Q5109277) (← links)
• Split Feasibility and Fixed Point Problems (Q5259717) (← links)
• Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization (Q5346622) (← links)
• Two stochastic optimization algorithms for convex optimization with fixed point constraints (Q5379458) (← links)
• The hybrid projection algorithm for finding the common fixed points of nonexpansive mappings and the zeroes of maximal monotone operators in Banach spaces (Q5495592) (← links)
• The augmented Lagrangian method can approximately solve convex optimization with least constraint violation (Q6102759) (← links)
• Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems (Q6173957) (← links)
• The geometry of monotone operator splitting methods (Q6598417) (← links)