G
Goran Banjac
Researcher at ETH Zurich
Publications - 37
Citations - 1090
Goran Banjac is an academic researcher from ETH Zurich. The author has contributed to research in topics: Convex optimization & Solver. The author has an hindex of 10, co-authored 29 publications receiving 589 citations. Previous affiliations of Goran Banjac include University of Oxford & University of Zagreb.
Papers
More filters
Journal ArticleDOI
OSQP: An Operator Splitting Solver for Quadratic Programs
TL;DR: This work presents a general-purpose solver for convex quadratic programs based on the alternating direction method of multipliers, employing a novel operator splitting technique that requires the solution of a quasi-definite linear system with the same coefficient matrix at almost every iteration.
Journal ArticleDOI
OSQP: an operator splitting solver for quadratic programs
TL;DR: OSQP as discussed by the authors is a general-purpose solver for convex quadratic programs based on the alternating direction method of multipliers, employing a novel operator splitting technique that requires the solution of a quasi-definite linear system with the same coefficient matrix at almost every iteration.
Proceedings ArticleDOI
OSQP: An Operator Splitting Solver for Quadratic Programs
TL;DR: OSQP as mentioned in this paper is a general purpose solver for quadratic programs based on the alternating direction method of multipliers, employing a novel operator splitting technique that requires the solution of a quasi-definite linear system with the same coefficient matrix in each iteration.
Journal ArticleDOI
Infeasibility Detection in the Alternating Direction Method of Multipliers for Convex Optimization
TL;DR: This work shows that in the limit the iterates of the alternating direction method of multipliers either satisfy a set of first-order optimality conditions or produce a certificate of either primal or dual infeasibility for optimization problems with linear or quadratic objective functions and conic constraints.
Proceedings ArticleDOI
Embedded code generation using the OSQP solver
Goran Banjac,Bartolomeo Stellato,Nicholas Moehle,Paul J. Goulart,Alberto Bemporad,Stephen Boyd +5 more
TL;DR: A code generation software package that accepts a parametric description of a quadratic program (QP) as input and generates tailored C code that compiles into a fast and reliable optimization solver for the QP that can run on embedded platforms is introduced.