Pages that link to "Item:Q288530"

The following pages link to Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings (Q288530):

Displaying 9 items.

• Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q312694) (← links)
• Proximal point algorithms for nonsmooth convex optimization with fixed point constraints (Q323195) (← links)
• Two parallel distribution algorithms for convex constrained minimization problems (Q884654) (← links)
• Fixed point quasiconvex subgradient method (Q2282530) (← links)
• Feasible methods for nonconvex nonsmooth problems with applications in green communications (Q2364485) (← links)
• Parallel optimization algorithm for smooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q2799656) (← links)
• Incremental subgradient method for nonsmooth convex optimization with fixed point constraints (Q2829569) (← links)
• Serial and Parallel Computation of Karush–Kuhn–Tucker Points via Nonsmooth Equations (Q4321315) (← links)
• Iterative methods for parallel convex optimization with fixed point constraints (Q5244136) (← links)