Pages that link to "Item:Q1085068"
From MaRDI portal
The following pages link to Sparsity-preserving SOR algorithms for separable quadratic and linear programming (Q1085068):
Displayed 24 items.
- Multisplitting iteration schemes for solving a class of nonlinear complementarity problems (Q871671) (← links)
- A conjugate gradient algorithm for sparse linear inequalities (Q915387) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- An algorithm for linearly constrained convex nondifferentiable minimization problems (Q1058460) (← links)
- More results on the convergence of iterative methods for the symmetric linear complementarity problem (Q1061019) (← links)
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs (Q1078096) (← links)
- A new result in the theory and computation of the least-norm solution of a linear program (Q1091260) (← links)
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs (Q1103527) (← links)
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem (Q1116899) (← links)
- Pairwise reactive SOR algorithm for quadratic programming of net import spatial equilibrium models (Q1118531) (← links)
- Successive linearization methods for large-scale nonlinear programming problems (Q1185122) (← links)
- An iterative SOR algorithm for multi-period spatial equilibria (Q1194716) (← links)
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs (Q1195287) (← links)
- Sufficient conditions for the convergence of monotonic mathematical programming algorithms (Q1230497) (← links)
- Parallel computation of intertemporal multicommodity spatial price equilibria in the presence of quotas (Q1308670) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- Descent methods for convex essentially smooth minimization (Q1321119) (← links)
- On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem (Q1837116) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- Iterative schemes for the least 2-norm solution of piecewise linear programs (Q1902107) (← links)
- A finite algorithm for the least two-norm solution of a linear program<sup>1</sup> (Q3778542) (← links)
- Matrix multisplitting relaxation methods for linear complementarity problems (Q4340160) (← links)
- Techniques of linear programming based on the theory of convex cones (Q4733657) (← links)