J
Jérôme Malick
Researcher at Centre national de la recherche scientifique
Publications - 97
Citations - 2638
Jérôme Malick is an academic researcher from Centre national de la recherche scientifique. The author has contributed to research in topics: Optimization problem & Semidefinite programming. The author has an hindex of 22, co-authored 89 publications receiving 2223 citations. Previous affiliations of Jérôme Malick include French Institute for Research in Computer Science and Automation & University of Grenoble.
Papers
More filters
Journal ArticleDOI
Projection-like Retractions on Matrix Manifolds
TL;DR: This theory offers a framework in which previously proposed retractions can be analyzed, as well as a toolbox for constructing new ones, for submanifolds of Euclidean spaces.
Journal ArticleDOI
Local Linear Convergence for Alternating and Averaged Nonconvex Projections
TL;DR: It is proved that von Neumann’s method of “alternating projections” converges locally to a point in the intersection, at a linear rate associated with a modulus of regularity.
Journal ArticleDOI
Alternating Projections on Manifolds
Adrian S. Lewis,Jérôme Malick +1 more
TL;DR: It is proved that if two smooth manifolds intersect transversally, then the method of alternating projections converges locally at a linear rate and the speed of convergence is bound in terms of the angle between the manifolds.
Journal ArticleDOI
Regularization Methods for Semidefinite Programming
TL;DR: This work introduces a new class of algorithms for solving linear semidefinite programming (SDP) problems based on classical tools from convex optimization such as quadratic regularization and augmented Lagrangian techniques and shows that the “boundary point method” is an instance of this class.
Journal ArticleDOI
A Dual Approach to Semidefinite Least-Squares Problems
TL;DR: This paper studies the projection onto the intersection of an affine subspace and a convex set and provides a particular treatment for the cone of positive semidefinite matrices and proposes a Lagrangian dualization of this least-squares problem, which leads to a conveX differentiable dual problem.