<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2003-10-16 08:07:54Mathematical optimization Numerical analysis Mathematical analysis Linear programming Convex optimization Interior point method Quadratic programming Global optimization Robert J. Vanderbei Quasi-Newton method Nonlinear programming Linear matrix inequality |
Add to Reading List |
Literaturverzeichnis 1. Alizadeh, F): A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs. Proceedings of the second ACMSIAM Symposium on Discrete Algorithms 2. Alizade
![ROBERT J. VANDERBEI Operations Research and Financial Engineering [removed] www.princeton.edu/∼rvdb/](https://www.pdfsearch.io/img/cad1c4e541b0631d7f3fd4e81aa74a08.jpg "ROBERT J. VANDERBEI Operations Research and Financial Engineering [removed] www.princeton.edu/∼rvdb/")
![ROBERT J. VANDERBEI Operations Research and Financial Engineering [removed] www.princeton.edu/∼rvdb](https://www.pdfsearch.io/img/6cc65f9489394dd9c23cbc695cd27dc2.jpg "ROBERT J. VANDERBEI Operations Research and Financial Engineering [removed] www.princeton.edu/∼rvdb")
