Iterative Solution of Linear Programs
From MaRDI portal
Publication:3925085
DOI10.1137/0718039zbMath0471.65033MaRDI QIDQ3925085
Publication date: 1981
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc283405/
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
90C05: Linear programming
Related Items
A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows, Least-norm linear programming solution as an unconstrained minimization problem, A row relaxation method for large minimax problems, A stable primal-dual approach for linear programming under nondegeneracy assumptions, The spherical constraint in Boolean quadratic programs, A hybrid algorithm for solving linear inequalities in a least squares sense, Sparsity-preserving SOR algorithms for separable quadratic and linear programming, Penalty-proximal methods in convex programming, Homotopy techniques in linear programming, A sparse sequential quadratic programming algorithm, A row relaxation method for large \(l_ 1\) problems, Newton's method for linear inequality systems, A numerical algorithm for hydrodynamic free boundary problems, On multilevel iterative methods for optimization problems, Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem, A global error bound for quadratic perturbation of linear programs, The adventures of a simple algorithm, Finding normal solutions in piecewise linear programming, A continuation method for monotone variational inequalities, A dual differentiable exact penalty function
