Goran Banjac
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
Goran Banjac has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Paul Goulart
Department of Engineering Science University of Oxford OX1 3PJ Oxford UK
6 shared publications - John Lygeros
Automatic Control Laboratory, ETH Zrich, Zrich, Switzerland
5 shared publications - Bartolomeo Stellato
Department of Operations Research and Financial Engineering, Princeton University, Princeton, USA
4 shared publications - Mario Vasak
University of Zagreb Faculty of Electrical Engineering and Computing, Zagreb, Croatia
4 shared publications Stephen Boyd
Stanford University
3 shared publications- Stephen Boyd
Stanford University
3 shared publications
Latest Publications
- 6 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 6, 2653-2658
Embedded Code Generation With CVXPY
We introduce CVXPYgen, a tool for generating custom C code, suitable for embedded applications, that solves a parameterized class of convex optimization problems. CVXPYgen is based on CVXPY, a Python-embedded domain-specific language that supports a natural syntax (that follows the mathematical description) for specifying convex optimization problems. Along with the C implementation of a custom solver, CVXPYgen creates a Python wrapper for prototyping and desktop (non-embedded) applications. We give two examples, position control of a quadcopter and back-testing a portfolio optimization model. CVXPYgen outperforms a state-of-the-art code generation tool in terms of problem size it can handle, binary code size, and solve times. CVXPYgen and the generated solvers are open-source.
- 6 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 6, 2653-2658
Embedded Code Generation With CVXPY
We introduce CVXPYgen, a tool for generating custom C code, suitable for embedded applications, that solves a parameterized class of convex optimization problems. CVXPYgen is based on CVXPY, a Python-embedded domain-specific language that supports a natural syntax (that follows the mathematical description) for specifying convex optimization problems. Along with the C implementation of a custom solver, CVXPYgen creates a Python wrapper for prototyping and desktop (non-embedded) applications. We give two examples, position control of a quadcopter and back-testing a portfolio optimization model. CVXPYgen outperforms a state-of-the-art code generation tool in terms of problem size it can handle, binary code size, and solve times. CVXPYgen and the generated solvers are open-source.
- Open Access
Embedded Code Generation with CVXPY
We introduce CVXPYgen, a tool for generating custom C code, suitable for embedded applications, that solves a parametrized class of convex optimization problems. CVXPYgen is based on CVXPY, a Python-embedded domain-specific language that supports a natural syntax (that follows the mathematical description) for specifying convex optimization problems. Along with the C implementation of a custom solver, CVXPYgen creates a Python wrapper for prototyping and desktop (non-embedded) applications. We give two examples, position control of a quadcopter and back-testing a portfolio optimization model. CVXPYgen outperforms a state-of-the-art code generation tool in terms of problem size it can handle, binary code size, and solve times. CVXPYgen and the generated solvers are open-source.
Open AccessEmbedded Code Generation with CVXPY
We introduce CVXPYgen, a tool for generating custom C code, suitable for embedded applications, that solves a parametrized class of convex optimization problems. CVXPYgen is based on CVXPY, a Python-embedded domain-specific language that supports a natural syntax (that follows the mathematical description) for specifying convex optimization problems. Along with the C implementation of a custom solver, CVXPYgen creates a Python wrapper for prototyping and desktop (non-embedded) applications. We give two examples, position control of a quadcopter and back-testing a portfolio optimization model. CVXPYgen outperforms a state-of-the-art code generation tool in terms of problem size it can handle, binary code size, and solve times. CVXPYgen and the generated solvers are open-source.
- Open Access
Stochastic convex optimization for provably efficient apprenticeship learning
We consider large-scale Markov decision processes (MDPs) with an unknown cost function and employ stochastic convex optimization tools to address the problem of imitation learning, which consists of learning a policy from a finite set of expert demonstrations. We adopt the apprenticeship learning formalism, which carries the assumption that the true cost function can be represented as a linear combination of some known features. Existing inverse reinforcement learning algorithms come with strong theoretical guarantees, but are computationally expensive because they use reinforcement learning or planning algorithms as a subroutine. On the other hand, state-of-the-art policy gradient based algorithms (like IM-REINFORCE, IM-TRPO, and GAIL), achieve significant empirical success in challenging benchmark tasks, but are not well understood in terms of theory. With an emphasis on non-asymptotic guarantees of performance, we propose a method that directly learns a policy from expert demonstrations, bypassing the intermediate step of learning the cost function, by formulating the problem as a single convex optimization problem over occupancy measures. We develop a computationally efficient algorithm and derive high confidence regret bounds on the quality of the extracted policy, utilizing results from stochastic convex optimization and recent works in approximate linear programming for solving forward MDPs.
Open AccessStochastic convex optimization for provably efficient apprenticeship learning
We consider large-scale Markov decision processes (MDPs) with an unknown cost function and employ stochastic convex optimization tools to address the problem of imitation learning, which consists of learning a policy from a finite set of expert demonstrations. We adopt the apprenticeship learning formalism, which carries the assumption that the true cost function can be represented as a linear combination of some known features. Existing inverse reinforcement learning algorithms come with strong theoretical guarantees, but are computationally expensive because they use reinforcement learning or planning algorithms as a subroutine. On the other hand, state-of-the-art policy gradient based algorithms (like IM-REINFORCE, IM-TRPO, and GAIL), achieve significant empirical success in challenging benchmark tasks, but are not well understood in terms of theory. With an emphasis on non-asymptotic guarantees of performance, we propose a method that directly learns a policy from expert demonstrations, bypassing the intermediate step of learning the cost function, by formulating the problem as a single convex optimization problem over occupancy measures. We develop a computationally efficient algorithm and derive high confidence regret bounds on the quality of the extracted policy, utilizing results from stochastic convex optimization and recent works in approximate linear programming for solving forward MDPs.
- 7 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (11) , 6263-6270
Distributed Model Predictive Control With Reconfigurable Terminal Ingredients for Reference Tracking
Various efforts have been devoted to developing stabilizing distributed Model Predictive Control (MPC) schemes for tracking piecewise constant references. In these schemes, terminal sets are usually computed offline and used in the MPC online phase to guarantee recursive feasibility and asymptotic stability. Maximal invariant terminal sets do not necessarily respect the distributed structure of the network, hindering the distributed implementation of the controller. On the other hand, ellipsoidal terminal sets respect the distributed structure, but may lead to conservative schemes. In this paper, a novel distributed MPC scheme is proposed for reference tracking of networked dynamical systems where the terminal ingredients are reconfigured online depending on the closed-loop states to alleviate the aforementioned issues. The resulting non-convex infinite-dimensional problem is approximated using a quadratic program. The proposed scheme is tested in simulation where the proposed MPC problem is solved using distributed optimization.
- 7 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 67 (11) , 6263-6270
Distributed Model Predictive Control With Reconfigurable Terminal Ingredients for Reference Tracking
Various efforts have been devoted to developing stabilizing distributed Model Predictive Control (MPC) schemes for tracking piecewise constant references. In these schemes, terminal sets are usually computed offline and used in the MPC online phase to guarantee recursive feasibility and asymptotic stability. Maximal invariant terminal sets do not necessarily respect the distributed structure of the network, hindering the distributed implementation of the controller. On the other hand, ellipsoidal terminal sets respect the distributed structure, but may lead to conservative schemes. In this paper, a novel distributed MPC scheme is proposed for reference tracking of networked dynamical systems where the terminal ingredients are reconfigured online depending on the closed-loop states to alleviate the aforementioned issues. The resulting non-convex infinite-dimensional problem is approximated using a quadratic program. The proposed scheme is tested in simulation where the proposed MPC problem is solved using distributed optimization.
- Open Access
Distributed Model Predictive Control with Reconfigurable Terminal Ingredients for Reference Tracking
Various efforts have been devoted to developing stabilizing distributed Model Predictive Control (MPC) schemes for tracking piecewise constant references. In these schemes, terminal sets are usually computed offline and used in the MPC online phase to guarantee recursive feasibility and asymptotic stability. Maximal invariant terminal sets do not necessarily respect the distributed structure of the network, hindering the distributed implementation of the controller. On the other hand, ellipsoidal terminal sets respect the distributed structure, but may lead to conservative schemes. In this paper, a novel distributed MPC scheme is proposed for reference tracking of networked dynamical systems where the terminal ingredients are reconfigured online depending on the closed-loop states to alleviate the aforementioned issues. The resulting non-convex infinite-dimensional problem is approximated using a quadratic program. The proposed scheme is tested in simulation where the proposed MPC problem is solved using distributed optimization.
Open AccessDistributed Model Predictive Control with Reconfigurable Terminal Ingredients for Reference Tracking
Various efforts have been devoted to developing stabilizing distributed Model Predictive Control (MPC) schemes for tracking piecewise constant references. In these schemes, terminal sets are usually computed offline and used in the MPC online phase to guarantee recursive feasibility and asymptotic stability. Maximal invariant terminal sets do not necessarily respect the distributed structure of the network, hindering the distributed implementation of the controller. On the other hand, ellipsoidal terminal sets respect the distributed structure, but may lead to conservative schemes. In this paper, a novel distributed MPC scheme is proposed for reference tracking of networked dynamical systems where the terminal ingredients are reconfigured online depending on the closed-loop states to alleviate the aforementioned issues. The resulting non-convex infinite-dimensional problem is approximated using a quadratic program. The proposed scheme is tested in simulation where the proposed MPC problem is solved using distributed optimization.
- Open Access
- 1 March 2021
- Published by Elsevier in Operations Research Letters
- Vol. 49 (2) , 197-200
On the minimal displacement vector of the Douglas–Rachford operator
- 1 March 2021
- Published by Elsevier in Operations Research Letters
- Vol. 49 (2) , 197-200
Open AccessOn the minimal displacement vector of the Douglas–Rachford operator
- Open Access
- 4 February 2021
- Published by Springer Nature in Optimization Letters
- Vol. 15 (8) , 2719-2732
On the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization
Banjac et al. (J Optim Theory Appl 183(2):490–519, 2019) recently showed that the Douglas–Rachford algorithm provides certificates of infeasibility for a class of convex optimization problems. In particular, they showed that the difference between consecutive iterates generated by the algorithm converges to certificates of primal and dual strong infeasibility. Their result was shown in a finite-dimensional Euclidean setting and for a particular structure of the constraint set. In this paper, we extend the result to real Hilbert spaces and a general nonempty closed convex set. Moreover, we show that the proximal-point algorithm applied to the set of optimality conditions of the problem generates similar infeasibility certificates.
- 4 February 2021
- Published by Springer Nature in Optimization Letters
- Vol. 15 (8) , 2719-2732
Open AccessOn the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization
Banjac et al. (J Optim Theory Appl 183(2):490–519, 2019) recently showed that the Douglas–Rachford algorithm provides certificates of infeasibility for a class of convex optimization problems. In particular, they showed that the difference between consecutive iterates generated by the algorithm converges to certificates of primal and dual strong infeasibility. Their result was shown in a finite-dimensional Euclidean setting and for a particular structure of the constraint set. In this paper, we extend the result to real Hilbert spaces and a general nonempty closed convex set. Moreover, we show that the proximal-point algorithm applied to the set of optimality conditions of the problem generates similar infeasibility certificates.
- Open Access
- 1 October 2020
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 144, 55-67
GPU acceleration of ADMM for large-scale quadratic programming
- 1 October 2020
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 144, 55-67
Open AccessGPU acceleration of ADMM for large-scale quadratic programming
- Top Cited Papers
- 20 February 2020
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 12 (4) , 637-672
OSQP: an operator splitting solver for quadratic programs
- 20 February 2020
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 12 (4) , 637-672
Top Cited PapersOSQP: an operator splitting solver for quadratic programs
- 1 January 2020
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 53 (2) , 13436-13441
Real-Time Solution to Quadratically Constrained Quadratic Programs for Predictive Converter Control
- 1 January 2020
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 53 (2) , 13436-13441
Real-Time Solution to Quadratically Constrained Quadratic Programs for Predictive Converter Control