Cones, Matrices and Mathematical Programming

by Abraham Berman

1. Convex Cones and linear Inequalities -- 1. Separation theorems -- 2. Cones and duals -- 3. Linear inequalities over cones -- 4. Theorems of the alternative -- 2. Mathematical Programming over Cones -- 5. Linear programming -- 6. Quadratic programming -- 7. The complementarity problem -- 8. Non-linear programming -- 3. Cones in Matrix Theory -- 9. Cones of matrices -- 10. Lyapunov type theorems -- 11. Cone monotonicity -- 12. Iterative methods for linear systems -- References -- Glossary of Notations.

Year of publication:	1973
Authors:	Berman, Abraham
Publisher:	Berlin : Springer
Subject:	Mathematische Optimierung \| Mathematical programming \| Theorie \| Theory \| Mathematik \| Mathematics \| Finanzmathematik \| Mathematical finance \| Lineare Algebra \| Linear algebra

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10013519964

A service of the