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. A:155–196 DOIs10107FULL LENGTH PAPER Nonlinear programming without a penalty function or a filter DocID: 1vb9n - View Document
	Undecidability and hardness in mixed-integer nonlinear programming Leo Liberti1 1 ´ DocID: 1v68K - View Document
	ooOPS A C++ Callable Object-Orientated Library for the Definition and Solution of Large, Sparse Mixed Integer Nonlinear Programming (MINLP) Problems Draft v. 1.25 DocID: 1v5c3 - View Document
	IEEE ADPRL 2017 Special Session: Title: Data-driven/Data-based Adaptive Dynamic Programming for Uncertain Nonlinear Systems Aim: Recently, data-driven/data-based reinforcement learning(RL) and adaptive dynamic programmi DocID: 1v30I - View Document
	1 date: April 2, 2015 L-CONVEX FUNCTIONS AND MCONVEX FUNCTIONS In the field of nonlinear programming (in continuous variables) convex analysis DocID: 1uMVL - View Document