Showing 1 - 10 of 117
We consider the problem of minimizing a univariate function f on an interval [a, b]. When f is a polynomial, we review how this problem may be reformulated as a semidefinite programming (SDP) problem, and review how to extract all global minimizers from the solution of the SDP problem. For...
Persistent link: https://www.econbiz.de/10014058535
Polynomials, trigonometric polynomials, and rational functions are widely used for the discrete approximation of functions or simulation models. Often, it is known beforehand, that the underlying unknown function has certain properties, e.g., nonnegative or increasing on a certain region....
Persistent link: https://www.econbiz.de/10014063851
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube.In addition, we show that there exists a polynomial time approximation scheme (PTAS) for minimizing Lipschitz continuous functions and functions with uniformly bounded Hessians over the standard...
Persistent link: https://www.econbiz.de/10012731994
Persistent link: https://www.econbiz.de/10002947692
Persistent link: https://www.econbiz.de/10003314846
In this paper we present the algorithmic framework and practical aspects of implementing a parallel version of a primal-dual semidefinite programming solver on a distributed memory computer cluster. Our implementation is based on the CSDP solver and uses a message passing interface (MPI), and...
Persistent link: https://www.econbiz.de/10014050442
The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO). It is NPhard, and contains the maximum stable set problem in graphs as a special case. In this note we show that the SQO problem may be reformulated as an...
Persistent link: https://www.econbiz.de/10014066389
We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP), that may be obtained via an SDP relaxation of the more general quadratic assignment problem (QAP). We show that the new relaxation dominates the one in the paper: D. Cvetkovic, M....
Persistent link: https://www.econbiz.de/10012722396
We consider the computational complexity of optimizing various classes of continuous functions over a simplex, hypercube or sphere.These relatively simple optimization problems have many applications.We review known approximation results as well as negative (inapproximability) results from the...
Persistent link: https://www.econbiz.de/10012732865
Persistent link: https://www.econbiz.de/10001830145