We study competitive economy equilibrium computation. We show that, for the first time, the equilibrium sets of the following two markets: 1. A mixed Fisher and Arrow-Debreu market with homogeneous ...

In this paper, we establish hardness and approximation results for various Lp-ball constrained homogeneous polynomial optimization problems, where p ∈ [2, ∞]. Specifically, we prove that for any given ...

Georgina Hall is an Assistant Professor of Decision Sciences at INSEAD. Her research is in optimization, with a focus on convex relaxations of NP-hard problems, particularly those arising in ...

What are some recent advances in non-convex optimization research? originally appeared on Quora - the knowledge sharing network where compelling questions are answered by people with unique insights.

Complexity theory is a branch of computer science that studies the resources required to solve computational problems, particularly focusing on the classification of problems based on their inherent ...