Algorithms for quadratic constrained matrix problems

DOI10.1016/0895-7177(92)90119-6zbMath0763.65045OpenAlexW2001756768MaRDI QIDQ1200862

Anna Nagurney, Alan G. Robinson

Publication date: 16 January 1993

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(92)90119-6

zbMATH Keywords

transportationcomputational experimentsblock-cyclic ascent methodGauss-Seidel schemequadratic constrained matrix problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

A survey on the continuous nonlinear resource allocation problem

Cites Work

• More results on the convergence of iterative methods for the symmetric linear complementarity problem
• Minimum norm problems over transportation polytopes
• Condition numbers and equilibration of matrices
• Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
• A lagrangean relaxation algorithm for the constrained matrix problem
• Nonlinear cost network models in transportation analysis
• A note on solution of large sparse maximum entropy problems with linear equality constraints
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• The Estimation of Large Social Account Matrices
• AN ALGORITHM FOR THE HITCHCOCK TRANSPORTATION PROBLEMS WITH QUADRATIC COST FUNCTIONS
• Dualität und Approximation bei konvexen Optimierungsproblemen
• An iterative scheme for variational inequalities
• Traffic assignment problem for a general network
• On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for quadratic constrained matrix problems