26 citations · 38 across the 10 of their papers we have counts for
10 papers
Computing normalized Nash equilibria for generalized Nash games with nonconvex players
Stuart M. Harwood, Dimitri J. Papageorgiou
Generalized Nash equilibrium (GNE) is a solution concept for complete information games, in which each player's objective function and feasible region depend on other players' acti…
Enhancing interval observers for state estimation using constraints
Stuart M. Harwood, Paul I. Barton
This work considers the problem of calculating an interval-valued state estimate for a nonlinear system subject to bounded inputs and measurement errors. Such state estimators are…
Pooling problems under perfect and imperfect competition
Dimitri J. Papageorgiou, Stuart M. Harwood, Francisco Trespalacios
We investigate pooling problems in which multiple players vie with one another to maximize individual profit in a non-cooperative competitive market. This competitive setting is in…
Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
Stuart Harwood, Francisco Trespalacios, Dimitri Papageorgiou +1
Solution methods for generalized Nash equilibrium have been dominated by variational inequalities and complementarity problems. Since these approaches fundamentally rely on the suf…
Improving the variational quantum eigensolver using variational adiabatic quantum computing
Stuart M. Harwood, Dimitar Trenev, Spencer T. Stober +4
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm for finding the minimum eigenvalue of a Hamiltonian that involves the optimization of a parameteri…
Considerations for evaluating thermodynamic properties with hybrid quantum-classical computing work-flows
Spencer T. Stober, Stuart M. Harwood, Donny Greenberg +3
Quantum chemistry applications on quantum computers currently rely heavily on the variational quantum eigensolver (VQE) algorithm. This hybrid quantum-classical algorithm aims at f…
A Note on Solving Discretely-Constrained Nash-Cournot Games via Complementarity
Dimitri J. Papageorgiou, Francisco Trespalacios, Stuart Harwood
Discretely-constrained Nash-Cournot games have attracted attention as they arise in various competitive energy production settings in which players must make one or more discrete d…
A note on semi-infinite program bounding methods
Stuart M. Harwood, Dimitri J. Papageorgiou, Francisco Trespalacios
Semi-infinite programs are a class of mathematical optimization problems with a finite number of decision variables and infinite constraints. As shown by Blankenship and Falk (Blan…
A note on generalized semi-infinite program bounding methods
Stuart M. Harwood
Generalized semi-infinite programs (GSIP) are a class of mathematical optimization problems that generalize semi-infinite programs, which have a finite number of decision variables…
Analysis of the alternating direction method of multipliers for nonconvex problems
Stuart M. Harwood
This work investigates the theoretical performance of the alternating-direction method of multipliers (ADMM) as it applies to nonconvex optimization problems, and in particular, pr…