VLDB 2026 Research / reviewers in the wild / expert
Jordan Ninin
dblp:47/9942
· DBLP profile ↗
8ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0002-7232-8246ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2Applied, interdisciplinary, general and emerging computing · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Hybridizing two linear relaxation techniques in interval-based solversabstractAbstract In deterministic global optimization, techniques for linear relaxation of a non-convex program are used in the lower bound calculation phase. To achieve this phase, most deterministic global optimization codes use reformulation-linearization techniques. However, there exist also two interval-based polyhedral relaxation techniques which produce reliable bounds without adding new auxiliary variables, and which can take into account mathematical operations and most transcendental functions: (i) the affine relaxation technique, used in the IBBA code, based on affine forms and affine arithmetic, and (ii) the extremal Taylor technique, used in the Ibex-Opt code, which is based on a specific interval-based Taylor form. In this paper, we describe how these two interval-based linear relaxation techniques can be hybridized. These two approaches appear to be complementary, and such a hybrid method performs well on a representative sample of constrained global optimization instances. Ignacio Araya 0001, Frédéric Messine, Jordan Ninin, Gilles Trombettoni |
J. Glob. Optim. | 3 |
| 2022 | Numerical certification of Pareto optimality for biobjective nonlinear problems
Charles Audet, Frédéric Messine, Jordan Ninin |
J. Glob. Optim. | 3 |
| 2022 | Correction to: Numerical certification of Pareto optimality for biobjective nonlinear problems
Charles Audet, Frédéric Messine, Jordan Ninin |
J. Glob. Optim. | 3 |
| 2020 | Sparse Branch and Bound for Exact Optimization of L0-Norm Penalized Least SquaresabstractWe propose a global optimization approach to solve ℓ0-norm penalized least-squares problems, using a dedicated branch-and-bound methodology. A specific tree search strategy is built, with branching rules inspired from greedy exploration techniques. We show that the subproblem involved at each node can be evaluated via ℓ1-norm-based optimization problems with box constraints, for which an active-set algorithm is built. Our method is able to solve exactly moderate-size, yet difficult, sparse approximation problems, without resorting to mixed-integer programming (MIP) optimization. In particular, it outperforms the generic MIP solver CPLEX. Ramzi Ben Mhenni, Sébastien Bourguignon, Marcel Mongeau, Jordan Ninin, Hervé Carfantan |
ICASSP | 4 |
| 2017 | Estimation of the likelihood function for non-linear optimization problems: Applications to the radiative transfer model in shallow waterabstractHyperspectral sensors provides informative data in many fields related to Earth observation. On the coastal zone, the inversion of radiative transfer models of the light has shown the ability to estimate parameters characterizing the water column. Particularly the water column depth, its concentration in non-algal particles, in phytoplankton, the bottom reflectance can be retrieved. Nevertheless the reliability of these estimations are difficult to clearly assess. In this paper a methodology based on interval arithmetic is presented to estimate the likelihood function. This allows to describe the behavior of this function around its maximum and therefore to evaluate the reliability of the solution. This methodology is applied to describe the influence of the noise level. Guillaume Sicot, Jordan Ninin, Marc Lennon, Audrey Minghelli, Adrien Deschamps |
IGARSS | 2 |
| 2013 | The Small Octagons of Maximal Width
Charles Audet, Pierre Hansen, Frédéric Messine, Jordan Ninin |
Discret. Comput. Geom. | 4 |
| 2013 | Maximal perimeter, diameter and area of equilateral unit-width convex polygons
Charles Audet, Jordan Ninin |
J. Glob. Optim. | 2 |
| 2011 | A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
Jordan Ninin, Frédéric Messine |
J. Glob. Optim. | 1 |