Stuart M. Harwood

According to our database, Stuart M. Harwood authored at least 9 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming.

Stuart M. Harwood, Francisco Trespalacios, Dimitri J. Papageorgiou, Kevin C. Furman

Comput. Optim. Appl., March, 2024

Utilizing modern computer architectures to solve mathematical optimization problems: A survey.

David E. Bernal Neira, Carl D. Laird, Laurens Lueg, Stuart M. Harwood, Dimitar Trenev, Davide Venturelli

Comput. Chem. Eng., 2024

2023

Pooling problems under perfect and imperfect competition.

Dimitri J. Papageorgiou, Stuart M. Harwood, Francisco Trespalacios

Comput. Chem. Eng., 2023

2021

Analysis of the Alternating Direction Method of Multipliers for Nonconvex Problems.

Stuart M. Harwood

Oper. Res. Forum, 2021

A note on semi-infinite program bounding methods.

Stuart M. Harwood, Dimitri J. Papageorgiou, Francisco Trespalacios

Optim. Lett., 2021

2017

How to solve a design centering problem.

Stuart M. Harwood, Paul I. Barton

Math. Methods Oper. Res., 2017

2016

Efficient solution of ordinary differential equations with a parametric lexicographic linear program embedded.

Stuart M. Harwood, Kai Höffner, Paul I. Barton

Numerische Mathematik, 2016

Efficient polyhedral enclosures for the reachable set of nonlinear control systems.

Stuart M. Harwood, Paul I. Barton

Math. Control. Signals Syst., 2016

Bounds on reachable sets using ordinary differential equations with linear programs embedded.

Stuart M. Harwood, Joseph K. Scott, Paul I. Barton

IMA J. Math. Control. Inf., 2016