Pages that link to "Item:Q2799656"

The following pages link to Parallel optimization algorithm for smooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q2799656):

Displaying 7 items.

• Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings (Q288530) (← links)
• Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q312694) (← links)
• Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (Q1779531) (← links)
• Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints (Q2255730) (← links)
• Fixed point optimization algorithm and its application to network bandwidth allocation (Q2428093) (← 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)