A decomposition method for solving a large-scale sparse system of linear equalities and inequalities by sequential quadratic programming

DOI10.1007/BF01075224MaRDI QIDQ4007347zbMATH OpenFDO

Authors O. N. Tokareva

Publication date 27 September 1992

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01075224

zbMATH Keywords

decomposition methodslarge sparse systemssequential quadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06)

Recommendations

• A conjugate gradient algorithm for sparse linear inequalities
• A decomposition algorithm for solving large-scale quadratic programming problems
• scientific article; zbMATH DE number 2217818
• scientific article; zbMATH DE number 3852786
• A dual approach to solving linear inequalities by unconstrained quadratic optimization

Cites work

• Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
• Solution of linear algebraic systems with rectangular matrices
• Solution of sparse linear least squares problems using Givens rotations

Cited in

(2)

• A Sparse QS-Decomposition for Large Sparse Linear System of Equations
• Solution of large linear systems with embedded network structure for a non-homogeneous network flow programming problem

This page was built for publication: A decomposition method for solving a large-scale sparse system of linear equalities and inequalities by sequential quadratic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4007347)