Pages that link to "Item:Q3925085"
From MaRDI portal
The following pages link to Iterative Solution of Linear Programs (Q3925085):
Displayed 20 items.
- Least-norm linear programming solution as an unconstrained minimization problem (Q593978) (← links)
- A row relaxation method for large minimax problems (Q688632) (← links)
- A stable primal-dual approach for linear programming under nondegeneracy assumptions (Q849092) (← links)
- The spherical constraint in Boolean quadratic programs (Q925238) (← links)
- A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming (Q1085068) (← links)
- Penalty-proximal methods in convex programming (Q1091267) (← links)
- Homotopy techniques in linear programming (Q1091937) (← links)
- A sparse sequential quadratic programming algorithm (Q1095793) (← links)
- A row relaxation method for large \(l_ 1\) problems (Q1176532) (← links)
- Newton's method for linear inequality systems (Q1296136) (← links)
- A numerical algorithm for hydrodynamic free boundary problems (Q1802296) (← links)
- On multilevel iterative methods for optimization problems (Q1813658) (← links)
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem (Q1837116) (← links)
- A global error bound for quadratic perturbation of linear programs (Q1861772) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- Finding normal solutions in piecewise linear programming (Q1900115) (← links)
- A continuation method for monotone variational inequalities (Q1908015) (← links)
- A dual differentiable exact penalty function (Q3959752) (← links)
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows (Q4342969) (← links)