Suche einschränken:
Zur Kasse

16 Ergebnisse.

On Kuhn's Strong Cubical Lemma

Freund, Robert Michael / Sloan School of Management
On Kuhn's Strong Cubical Lemma
This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work. This ...

CHF 40.90

On the Primal-duty Geometry of Level Sets in Linear and C...

Freund, Robert Michael / Sloan School Of Management
On the Primal-duty Geometry of Level Sets in Linear and Conic Optimization
This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.This w...

CHF 18.50

On the Complexity of Four Polyhedral Set Containment Prob...

Freund, Robert Michael
On the Complexity of Four Polyhedral Set Containment Problems (Classic Reprint)
Excerpt from On the Complexity of Four Polyhedral Set Containment ProblemsA nonempty closed convex polyhedron X can be represented either in the form X where (a, b) are given, in which case X is called an H - cell (h for halfspaces), or in the form X where (u, v) are given, in which case X is called a w - cell (w for weighting of points). The computational complexity of many problems related to polyhedra depend on the polyhedral representation...

CHF 39.50

On the Complexity of Four Polyhedral Set Containment Prob...

Freund, Robert Michael
On the Complexity of Four Polyhedral Set Containment Problems (Classic Reprint)
Excerpt from On the Complexity of Four Polyhedral Set Containment ProblemsA nonempty closed convex polyhedron X can be represented either in the form X where (a, b) are given, in which case X is called an H - cell (h for halfspaces), or in the form X where (u, v) are given, in which case X is called a w - cell (w for weighting of points). The computational complexity of many problems related to polyhedra depend on the polyhedral representation...

CHF 12.90

Projective Transformations for Interior Point Methods, Vo...

Freund, Robert Michael
Projective Transformations for Interior Point Methods, Vol. 2
Excerpt from Projective Transformations for Interior Point Methods, Vol. 2: Analysis of an Algorithm for Finding the Weighted Center of a Polyhedral SystemPart II of this study uses the projective-centering and the local improvement methodologies developed in Part I 3 to develop an algorithm for finding the.About the PublisherForgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.comThis book...

CHF 40.90

Projective Transformations for Interior Point Methods, Vo...

Freund, Robert Michael
Projective Transformations for Interior Point Methods, Vol. 2
Excerpt from Projective Transformations for Interior Point Methods, Vol. 2: Analysis of an Algorithm for Finding the Weighted Center of a Polyhedral System A of X To be more precise, we should say that x is the w-center of X (a, b, M, g. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Boo...

CHF 12.50