Pages that link to "Item:Q3885509"
From MaRDI portal
The following pages link to The Relaxation Method for Solving Systems of Linear Inequalities (Q3885509):
Displaying 50 items.
- A condition-based algorithm for solving polyhedral feasibility problems (Q457560) (← links)
- On highly eccentric cones (Q464809) (← links)
- Some preconditioners for systems of linear inequalities (Q476281) (← links)
- Partial inverse of a monotone operator (Q585088) (← links)
- Inradius and circumradius of various convex cones arising in applications (Q618877) (← links)
- Asymptotics for some proximal-like method involving inertia and memory aspects (Q632230) (← links)
- Finite convergence of a subgradient projections method with expanding controls (Q649124) (← links)
- Robust smoothed analysis of a condition number for linear programming (Q662310) (← links)
- Convergence studies on block iterative algorithms for image reconstruction (Q668514) (← links)
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems (Q676010) (← links)
- Reflection-projection method for convex feasibility problems with an obtuse cone (Q704736) (← links)
- Extending linear relaxation for non-square matrices and soft constraints (Q738985) (← links)
- A polynomial projection algorithm for linear feasibility problems (Q747780) (← links)
- On the convergence properties of Hildreth's quadratic programming algorithm (Q749443) (← links)
- Relaxed outer projections, weighted averages and convex feasibility (Q751771) (← links)
- Nonnegative Moore--Penrose inverses of Gram operators (Q874997) (← links)
- A conjugate gradient algorithm for sparse linear inequalities (Q915387) (← links)
- Coverage processes on spheres and condition numbers for linear programming (Q964778) (← links)
- On properties of different notions of centers for convex cones (Q977073) (← links)
- On strata of degenerate polyhedral cones. I: Condition and distance to strata (Q1027575) (← links)
- Conditioning of random conic systems under a general family of input distributions (Q1029212) (← links)
- A primal-dual projection method for solving systems of linear inequalities (Q1058270) (← links)
- An automatic relaxation method for solving interval linear inequalities (Q1060533) (← links)
- On some optimization techniques in image reconstruction from projections (Q1109546) (← links)
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program (Q1260956) (← links)
- Surrogate methods for linear inequalities (Q1321147) (← links)
- About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. II (Q1347145) (← links)
- About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I (Q1347165) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- The MIN PFS problem and piecewise linear model estimation (Q1348259) (← links)
- Fixed points of polarity type operators (Q1664494) (← links)
- Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach (Q1675553) (← links)
- A class of methods for solving large convex systems (Q1813379) (← links)
- A projection method for least-squares solutions to overdetermined systems of linear inequalities (Q1821512) (← links)
- Geometrically convergent projection method in matrix games (Q1897450) (← links)
- Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
- Primal-dual row-action method for convex programming (Q1904955) (← links)
- Piecewise linear retractions by reflexion (Q2265339) (← links)
- Hildreth's algorithm with applications to soft constraints for user interface layout (Q2351069) (← links)
- Central axes and peripheral points in high dimensional directional datasets (Q2397819) (← links)
- Normality and modulability indices. I: Convex cones in normed spaces (Q2473889) (← links)
- On the von Neumann and Frank-Wolfe algorithms with away steps (Q2789610) (← links)
- Towards a deeper geometric, analytic and algorithmic understanding of margins (Q2815511) (← links)
- On Chubanov's Method for Linear Programming (Q2962562) (← links)
- Rescaled Coordinate Descent Methods for Linear Programming (Q3186489) (← links)
- Convergence of the cyclical relaxation method for linear inequalities (Q3337217) (← links)
- On the behavior of a block-iterative projection method for solving convex feasibility problems (Q3491319) (← links)
- Variable metric relaxation methods, part II: The ellipsoid method (Q3683896) (← links)
- On the non-polynomiality of the relaxation method for systems of linear inequalities (Q3929533) (← links)
- The Kaczmarz algorithm, row action methods, and statistical learning algorithms (Q4686248) (← links)
