The following pages link to (Q5520839):
Displayed 15 items.
- Finite convergence of a subgradient projections method with expanding controls (Q649124) (← links)
- A finitely convergent ``row-action'' method for the convex feasibility problem (Q1109529) (← links)
- On relaxation methods for systems of linear inequalities (Q1159953) (← links)
- An interior points algorithm for the convex feasibility problem (Q1166775) (← links)
- A superlinearly convergent projection algorithm for solving the convex inequality problem (Q1271387) (← links)
- New iterative methods for linear inequalities (Q1321142) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- Subgradient methods for sharp weakly convex functions (Q1626538) (← links)
- Linear inequalities and some of their applications (Q1845047) (← links)
- A global quadratic algorithm for solving a system of mixed equalities and inequalities (Q3920999) (← links)
- Solving nonsmooth inclusions in the convex case (Q3980567) (← links)
- On finitely convergent iterative methods for the convex feasibility problem (Q3991358) (← links)
- Linear complementarity problems solvable by A single linear program (Q4127631) (← links)
- Optimization of lipschitz continuous functions (Q4177351) (← links)
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity (Q4558142) (← links)