Showing 1 - 10 of 100
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/10011091363
Persistent link: https://www.econbiz.de/10009787380
We present two recent integer programming models in molecular biology and study practical reformulations to compute solutions to some of these problems. In extension of previously tested linearization techniques, we formulate corresponding semidefinite relaxations and discuss practical rounding...
Persistent link: https://www.econbiz.de/10010888468
Persistent link: https://www.econbiz.de/10011338688
In this paper we study the properties of the analytic central path of asemidefinite programming problem under perturbation of a set of inputparameters. Specifically, we analyze the behavior of solutions on the centralpath with respect to changes on the right hand side of the...
Persistent link: https://www.econbiz.de/10010324706
We study disclosure of information about the multidimensional state of the world when uninformed receivers' actions affect the sender's utility. Given a disclosure rule, the receivers form an expectation about the state following each message. Under the assumption that the sender's expected...
Persistent link: https://www.econbiz.de/10010332526
In this paper, we develop various calculus rules for general smooth matrix-valued functions and for the class of matrix convex (or concave) functions first introduced by Loewner and Kraus in 1930s. Then we use these calculus rules and the matrix convex function -log X to study a new notion of...
Persistent link: https://www.econbiz.de/10004969823
Parameter uncertainty has been a recurrent subject treated in the financial literature. The normative portfolio selection approach considers two main kinds of decision rules: expected expected utility maximization and mean-variance criterion. Assuming that the mean-variance criterion is a good...
Persistent link: https://www.econbiz.de/10011105507
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E....
Persistent link: https://www.econbiz.de/10011090357
AMS classification: 90C22, 20Cxx, 70-08
Persistent link: https://www.econbiz.de/10011090442