Iterative Solution of Linear Programs
From MaRDI portal
Cited in
(22)- A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints
- A row relaxation method for large minimax problems
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- A sparse sequential quadratic programming algorithm
- A row relaxation method for large \(l_ 1\) problems
- A hybrid algorithm for solving linear inequalities in a least squares sense
- PAL-Hom method for QP and an application to LP
- Penalty-proximal methods in convex programming
- Least-norm linear programming solution as an unconstrained minimization problem
- A dual differentiable exact penalty function
- 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
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- The adventures of a simple algorithm
- Finding normal solutions in piecewise linear programming
- A continuation method for monotone variational inequalities
- On multilevel iterative methods for optimization problems
- A numerical algorithm for hydrodynamic free boundary problems
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
- The spherical constraint in Boolean quadratic programs
- Homotopy techniques in linear programming
- Newton's method for linear inequality systems
This page was built for publication: Iterative Solution of Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3925085)
