26 datasets found

This article addresses a general criterion providing a zero duality gap for convex programs in the setting of the real locally convex spaces. The main theorem of our...

This article uses classical notions of convex analysis over euclidean spaces, like Gale & Klee's boundary rays and asymptotes of a convex set, or the inner...

International audience

Cahier de Recherche du Groupe HEC n° 960/2012

In this paper we present a new penalty-based approach, developed within the framework of Genetic Algorithms (GAs) for constrained optimisation problems. The proposed...

W e present a physics-based deformable model framework for the incremental object shape estimation and tracking in image sequences. The model is estimated by an...

We study the problem of articulated 3D human motion tracking in monocular video sequences. Addressing problems related to unconstrained scene structure, uncertainty,...

This paper introduces and analyses a new algorithm for minimizing a convex function subject to a finite number of convex inequality constraints. It is assumed that the...

We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm...

Projet PROMATH

Projet PROMATH

Projet PROMATH

The problem of maximizing a non-negative generalized polynomial of degree at most $p$ on the $l_p$-sphere is shown to be equivalent to a concave one. Arguments where...

Projet PROMATH

White Paper

Optimization takes place in many IFPEN applications: for instance estimation of parameters of numerical models from experimental data in geosciences or for engine...

International audience

Best paper award

International audience

International audience