Pages that link to "Item:Q2427393"

The following pages link to How good are projection methods for convex feasibility problems? (Q2427393):

Displaying 10 items.

• Fundamentals of cone regression (Q289730) (← links)
• Anderson acceleration of the alternating projections method for computing the nearest correlation matrix (Q306368) (← links)
• Single-projection procedure for linear optimization (Q330507) (← links)
• Distance majorization and its applications (Q403660) (← links)
• On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
• How good are extrapolated bi-projection methods for linear feasibility problems? (Q429520) (← links)
• Convergence analysis of a parallel projection algorithm for solving convex feasibility problems (Q501512) (← links)
• Numerical methods for solving some matrix feasibility problems (Q509640) (← links)
• A non-interior continuation algorithm for solving the convex feasibility problem (Q1634140) (← links)
• Iterative algorithm for solving a class of convex feasibility problem (Q1736385) (← links)