Pages that link to "Item:Q2460116"
From MaRDI portal
The following pages link to A finite steps algorithm for solving convex feasibility problems (Q2460116):
Displaying 13 items.
- Single-projection procedure for linear optimization (Q330507) (← links)
- Gradient-type methods: a unified perspective in computer science and numerical analysis (Q420252) (← links)
- Generalized projections onto convex sets (Q427407) (← links)
- Reflection-projection method for convex feasibility problems with an obtuse cone (Q704736) (← links)
- An alternating projections algorithm for solving linear programs (Q991560) (← links)
- Insurance pricing using \(H_{\infty}\)-control (Q1646165) (← links)
- Constraint consensus methods for finding strictly feasible points of linear matrix inequalities (Q1659091) (← links)
- A log-quadratic projection method for convex feasibility problems (Q2768005) (← links)
- On the finite termination of the Douglas-Rachford method for the convex feasibility problem (Q2836088) (← links)
- Accelerated reflection projection algorithm and its application to the LMI problem (Q3453404) (← links)
- On the application of alternating projection under the constraint of linear matrix inequalities (Q4237960) (← links)
- Formalization of Incremental Simplex Algorithm by Stepwise Refinement (Q4647860) (← links)
- (Q5399378) (← links)