BABrandon Augustino

Brandon Augustino

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Brandon Augustino has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Improvements to Quantum Interior Point Method for Linear Optimization

    by Mohammadhossein Mohammadisiahroudi, Zeguan Wu, Brandon Augustino, Arielle Carr, Tamás Terlaky

    Quantum linear system algorithms (QLSAs) have the potential to speed up Interior Point Methods (IPMs). However, a major bottleneck is the inexactness of quantum tomography to extract classical solutions from quantum states. In addition, QLSAs are sensitive to the condition number, and this sensitivity is exacerbated when the Newton systems arising in IPMs converge to a singular matrix. Recently, an Inexact Feasible Quantum IPM (IF-QIPM) has been developed that addresses the inexactness of QLSAs. However, this method requires a large number of gates and qubits to be implemented. Here, we propose a new IF-QIPM using the normal equation system, which requires fewer gates and qubits. To mitigate the sensitivity to the condition number and other input data-related parameters, we use preconditioning coupled with iterative refinement to obtain better complexity. Finally, we demonstrate the effectiveness of our approach on IBM Qiskit simulators.


  • Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments

    by Mohammadhossein Mohammadisiahroudi, Ramin Fakhimi, Brandon Augustino, Tamás Terlaky


  • Open Access

    Co-optimizing the smart grid and electric public transit bus system

    by Mertcan Yetkin, Brandon Augustino, Alberto J. Lamadrid, Lawrence V. Snyder

    As climate change provides impetus for investing in smart cities, with electrified public transit systems, we consider electric public transportation buses in an urban area, which play a role in the power system operations in addition to their typical function of serving public transit demand. Our model considers a social planner, such that the transit authority and the operator of the electricity system co-optimize the power system to minimize the total operational cost of the grid, while satisfying additional transportation constraints on buses. We provide deterministic and stochastic formulations to co-optimize the system. Each stochastic formulation provides a different set of recourse actions to manage the variable renewable energy uncertainty: ramping up/down of the conventional generators, or charging/discharging of the transit fleet. We demonstrate the capabilities of the model and the benefit obtained via a coordinated strategy. We compare the efficacies of these recourse actions to provide additional managerial insights. We analyze the effect of different pricing strategies on the co-optimization. Noting the stress growing electrified fleets with greater battery capacities will eventually impose on a power network, we provide theoretical insights on coupled investment strategies for expansion planning in order to reduce greenhouse gas (GH) emissions. Given the recent momentum towards building smarter cities and electrifying transit systems, our results provide policy directions towards a sustainable future. We test our models using modified MATPOWER case files and verify our results with different sized power networks. This study is motivated by a project with a large transit authority in California.


  • Top Cited Papers
    Open Access

    Quantum Interior Point Methods for Semidefinite Optimization

    by Brandon Augustino, Giacomo Nannicini, Tamás Terlaky, Luis F. Zuluaga

    We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact search direction and is not guaranteed to explore only feasible points; the second scheme uses a nullspace representation of the Newton linear system to ensure feasibility even with inexact search directions. The second is a novel scheme that might seem impractical in the classical world, but it is well-suited for a hybrid quantum-classical setting. We show that both schemes converge to an optimal solution of the semidefinite optimization problem under standard assumptions. By comparing the theoretical performance of classical and quantum interior point methods with respect to various input parameters, we show that our second scheme obtains a speedup over classical algorithms in terms of the dimension of the problem n , but has worse dependence on other numerical parameters.


  • Open Access

    Quantum Interior Point Methods for Semidefinite Optimization

    by Brandon Augustino, Giacomo Nannicini, Tamás Terlaky, Luis F. Zuluaga

    We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact search direction and is not guaranteed to explore only feasible points; the second scheme uses a nullspace representation of the Newton linear system to ensure feasibility even with inexact search directions. The second is a novel scheme that might seem impractical in the classical world, but it is well-suited for a hybrid quantum-classical setting. We show that both schemes converge to an optimal solution of the semidefinite optimization problem under standard assumptions. By comparing the theoretical performance of classical and quantum interior point methods with respect to various input parameters, we show that our second scheme obtains a speedup over classical algorithms in terms of the dimension of the problem $n$, but has worse dependence on other numerical parameters.


  • Quantum Linear Algebra

    by Brandon Augustino, Giacomo Nannicini

  • Open Access

    An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization

    by Zeguan Wu, Mohammadhossein Mohammadisiahroudi, Brandon Augustino, Xiu Yang, Tamás Terlaky

    Quantum linear system algorithms (QLSAs) have the potential to speed up algorithms that rely on solving linear systems. Interior point methods (IPMs) yield a fundamental family of polynomial-time algorithms for solving optimization problems. IPMs solve a Newton linear system at each iteration to compute the search direction; thus, QLSAs can potentially speed up IPMs. Due to the noise in contemporary quantum computers, quantum-assisted IPMs (QIPMs) only admit an inexact solution to the Newton linear system. Typically, an inexact search direction leads to an infeasible solution, so, to overcome this, we propose an inexact-feasible QIPM (IF-QIPM) for solving linearly constrained quadratic optimization problems. We also apply the algorithm to ℓ1-norm soft margin support vector machine (SVM) problems, and demonstrate that our algorithm enjoys a speedup in the dimension over existing approaches. This complexity bound is better than any existing classical or quantum algorithm that produces a classical solution.


  • Open Access

    An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization

    by Zeguan Wu, Mohammadhossein Mohammadisiahroudi, Brandon Augustino, Xiu Yang, Tamás Terlaky

    Quantum linear system algorithms (QLSAs) have the potential to speed up algorithms that rely on solving linear systems. Interior Point Methods (IPMs) yield a fundamental family of polynomial-time algorithms for solving optimization problems. IPMs solve a Newton linear system at each iteration to find the search direction, and thus QLSAs can potentially speed up IPMs. Due to the noise in contemporary quantum computers, such quantum-assisted IPM (QIPM) only allows an inexact solution for the Newton linear system. Typically, an inexact search direction leads to an infeasible solution. In our work, we propose an Inexact-Feasible QIPM (IF-QIPM) and show its advantage in solving linearly constrained quadratic optimization problems. We also apply the algorithm to $\ell_1$-norm soft margin support vector machine (SVM) problems and obtain the best complexity regarding dependence on dimension. This complexity bound is better than any existing classical or quantum algorithm that produces a classical solution.

  • Open Access

    Co-optimizing the Smart Grid and Electric Public Transit Bus System

    by Mertcan Yetkin, Brandon R. Augustino, Alberto J. Lamadrid, Lawrence V. Snyder

    As climate change provides impetus for investing in smart cities, with electrified public transit systems, we consider electric public transportation buses in an urban area, which play a role in the power system operations in addition to their typical function of serving public transit demand. Our model considers a social planner, such that the transit authority and the operator of the electricity system co-optimize the power system to minimize the total operational cost of the grid, while satisfying additional transportation constraints on buses. We provide deterministic and stochastic formulations to co-optimize the system. Each stochastic formulation provides a different set of recourse actions to manage the variable renewable energy uncertainty: ramping up/down the conventional generators, or charging/discharging of the transit fleet. We demonstrate the capabilities of the model and the benefit obtained via a coordinated strategy. We compare the efficacies of these recourse actions to provide additional managerial insights. We analyze the effect of different pricing strategies on the co-optimization. We also conduct congestion analysis in the power network, comparing our cooperative approach to a non-cooperative strategy when we assume electrified fleet sizes grow with greater battery capacities. Given the recent momentum towards building smarter cities and electrifying transit systems, our results provide policy directions towards a sustainable future. We test our models using modified MATPOWER case files and verify our results with different sized power networks. This study is motivated by a project with a large transit authority in California.