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

First Page		Document Content
Date: 2003-10-16 08:07:54 Mathematical 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		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 Add to Reading List Source URL: www.opt.uni-duesseldorf.de Download Document from Source Website File Size: 498,64 KB Share Document on Facebook

	Math. Program., Ser. B 100: 95–Digital Object Identifier (DOIs10107Nick Gould · Philippe L. Toint Preprocessing for quadratic programming DocID: 1v8H0 - View Document
	LEARNING A CLASSIFICATION OF MIXED-INTEGER QUADRATIC PROGRAMMING PROBLEMS Pierre Bonami Andrea Lodi DocID: 1ulPL - View Document
	Feedback for reg. noCE000: Programming in Java — Roots of a Quadratic Presentation: 12/25 Oh dear! Your program is absolutely devoid of comments, which means that anyone encountering the code for the first DocID: 1u6LO - View Document
	A weighted gram-schmidt method for convex quadratic programming DocID: 1tRnC - View Document
	Technical Report TRA Comparison of Several Solvers for Bound Constraint Quadratic Programming within the Context of Frictionless Multibody Dynamics DocID: 1tHhe - View Document