Personne

Jean-Hubert Hours

Cette personne n’est plus à l’EPFL

Publications associées (15)

Real-Time Distributed Algorithms for Nonconvex Optimal Power Flow

Colin Neil Jones, Georgios Stathopoulos, Jean-Hubert Hours, Yuejiang Liu

The optimal power flow (OPF) problem, a fundamental problem in power systems, is generally nonconvex and computationally challenging for networks with an increasing number of smart devices and real-time control requirements. In this paper, we first investi ...

2017

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

Colin Neil Jones, Jean-Hubert Hours

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 ingredient is an alternating projected gradient sweep in place of the Cauchy po ...

2017

Decomposition Strategies for Nonconvex Problems, a Parametric Approach

Jean-Hubert Hours

This thesis deals with the development of numerical methods for solving nonconvex optimisation problems by means of decomposition and continuation techniques. We first introduce a novel decomposition algorithm based on alternating gradient projections and ...

EPFL2016

A Parametric Nonconvex Decomposition Algorithm for Real-Time and Distributed NMPC

Colin Neil Jones, Jean-Hubert Hours

A novel decomposition scheme to solve parametric nonconvex programs as they arise in Nonlinear Model Predictive Control (NMPC) is presented. It consists of a fixed number of alternating proximal gradient steps and a dual update per time step. Hence, the pr ...

2016

A parametric augmented Lagrangian algorithm for real-time economic NMPC

Colin Neil Jones, Jean-Hubert Hours, Harsh Ambarishkumar Shukla

In this paper, a novel optimality-tracking algorithm for solving Economic Nonlinear Model Predictive Control (ENMPC) problems in real-time is presented. Developing online schemes for ENMPC is challenging, since it is unclear how convexity of the Quadratic ...

IEEE2016

An Optimization-based Approach to Extract Faceted Crystal Shapes from Stereoscopic Images

Colin Neil Jones, Jean-Hubert Hours, Thomas Vetter

The size and shape of particles crucially influences the characteristics of solid products. Until recently these quantities were evaluated using light microscopy. However, extracting the three-dimensional shape of a faceted crystal from a single image is a ...

Elsevier2015

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

Colin Neil Jones, Jean-Hubert Hours

2015

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

Colin Neil Jones, Jean-Hubert Hours

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 alternating proximal gradient steps and a dual update per time step. Hence, the p ...

2014

A parametric multi-convex splitting technique with application to real-time NMPC

Colin Neil Jones, Jean-Hubert Hours

A novel splitting scheme to solve parametric multi-convex programs is presented. It consists of a fixed number of proximal alternating minimisations and a dual update per time step, which makes it attractive in a real-time Nonlinear Model Predictive Contro ...

2014

Parametric Polytope Reconstruction, an Application to Crystal Shape Estimation

Colin Neil Jones, Jean-Hubert Hours

In situ imaging techniques are a promising direction for monitoring the distribution of crystal sizes and shapes during a crystallization process. Nevertheless, no tractable method yet exists for estimating complex crystal shapes. In this paper, an in situ ...

Institute of Electrical and Electronics Engineers2014

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search