A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC lin...
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...
The elastic-mode formulation of the problem of minimizing a nonlinear function subject to equilibrium constraints has appealing local properties in that, for a finite value of the...