Iterative Solution of Linear Programs
From MaRDI portal
Publication:3925085
DOI10.1137/0718039zbMath0471.65033OpenAlexW2055978654MaRDI 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/
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05)
Related Items
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 stable primal-dual approach for linear programming under nondegeneracy assumptions, Finding normal solutions in piecewise linear programming, A continuation method for monotone variational inequalities, Least-norm linear programming solution as an unconstrained minimization problem, PAL-Hom method for QP and an application to LP, A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows, The spherical constraint in Boolean quadratic programs, A row relaxation method for large \(l_ 1\) problems, A row relaxation method for large minimax problems, A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints, A numerical algorithm for hydrodynamic free boundary problems, A hybrid algorithm for solving linear inequalities in a least squares sense, On multilevel iterative methods for optimization problems, Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem, Newton's method for linear inequality systems, A global error bound for quadratic perturbation of linear programs, The adventures of a simple algorithm, A dual differentiable exact penalty function
