scientific article; zbMATH DE number 554736

zbMath0815.65080MaRDI QIDQ4288553

Philip E. Gill, Walter Murray, Dulce B. Ponceleón, Michael A. Saunders

Publication date: 30 June 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programmingconstrained optimizationprimal-dual algorithmbarrier methodsHarwell subroutine libraryKurish-Kuhn-Tucker systemreduced KKT systems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (14)

Interior dual proximal point algorithm for linear programs ⋮ Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement ⋮ A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows ⋮ Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy ⋮ Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods ⋮ Deriving potential functions via a symmetry principle for nonlinear equations ⋮ Primal-dual methods for linear programming ⋮ A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme ⋮ Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods ⋮ An adaptively regularized sequential quadratic programming method for equality constrained optimization ⋮ A barrier method for dynamic Leontief-type linear programs ⋮ A primal-dual regularized interior-point method for convex quadratic programs ⋮ Splitting dense columns in sparse linear systems ⋮ Computational experience with a primal-dual interior point method for linear programming

Uses Software

• MA27
• Unnamed Item

This page was built for publication: