most citedA Parametric Non-Convex Decomposition Algorithm for Real-Time and Distributed NMPC

3 citations · 7 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LG2015

A provably convergent alternating minimization method for mean field inference

Pierre Baqué, Jean-Hubert Hours, François Fleuret +1

Mean-Field is an efficient way to approximate a posterior distribution in complex graphical models and constitutes the most popular class of Bayesian variational approximation meth…

math.OC2015★ 3 cited

An Alternating Trust Region Algorithm for Distributed Linearly Constrained Nonlinear Programs, Application to the AC Optimal Power Flow

Jean-Hubert Hours, Colin N. Jones

A novel trust region method for solving linearly constrained nonlinear programs is presented. The proposed technique is amenable to a distributed implementation, as its salient ing…

math.OC2014★ 3 cited

A Parametric Non-Convex Decomposition Algorithm for Real-Time and Distributed NMPC

Jean-Hubert Hours, Colin N. Jones

A novel decomposition scheme to solve parametric non-convex programs as they arise in Nonlinear Model Predictive Control (NMPC) is presented. It consists of a fixed number of alter…

math.OC2014

A Parametric Multi-Convex Splitting Technique with Application to Real-Time NMPC

Jean-Hubert Hours, Colin N. Jones

A novel splitting scheme to solve parametric multiconvex programs is presented. It consists of a fixed number of proximal alternating minimisations and a dual update per time step,…

math.OC2014★ 1 cited

An Augmented Lagrangian Coordination-Decomposition Algorithm for Solving Distributed Non-Convex Programs

Jean-Hubert Hours, Colin N. Jones

A novel augmented Lagrangian method for solving non-convex programs with nonlinear cost and constraint couplings in a distributed framework is presented. The proposed decomposition…