Jérôme Malick

According to our database1, Jérôme Malick authored at least 43 papers between 2004 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Approximate Joint Diagonalization with Riemannian Optimization on the General Linear Group.
SIAM J. Matrix Anal. Appl., 2020

A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm.
SIAM J. Optim., 2020

Asynchronous level bundle methods.
Math. Program., 2020

First-order Optimization for Superquantile-based Supervised Learning.
CoRR, 2020

Randomized Progressive Hedging methods for Multi-stage Stochastic Programming.
CoRR, 2020

Explore Aggressively, Update Conservatively: Stochastic Extragradient Methods with Variable Stepsize Scaling.
CoRR, 2020

Device Heterogeneity in Federated Learning: A Superquantile Approach.
CoRR, 2020

Eventual convexity of probability constraints with elliptical distributions.
Math. Program., 2019

On the convergence of single-call stochastic extra-gradient methods.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Model Consistency for Learning with Mirror-Stratifiable Regularizers.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Riemannian Optimization and Approximate Joint Diagonalization for Blind Source Separation.
IEEE Trans. Signal Process., 2018

Sensitivity Analysis for Mirror-Stratifiable Convex Functions.
SIAM J. Optim., 2018

On the Proximal Gradient Algorithm with Alternated Inertia.
J. Optim. Theory Appl., 2018

Asynchronous Distributed Learning with Sparse Communications and Identification.
CoRR, 2018

A Delay-tolerant Proximal-Gradient Algorithm for Distributed Learning.
Proceedings of the 35th International Conference on Machine Learning, 2018

BiqCrunch: A Semidefinite Branch-and-Bound Method for Solving Binary Quadratic Problems.
ACM Trans. Math. Softw., 2017

Second-order differentiability of probability functions.
Optim. Lett., 2017

Uncontrolled inexact information within bundle methods.
EURO J. Comput. Optim., 2017

Regularized decomposition of large scale block-structured robust optimization problems.
Comput. Manag. Sci., 2017

Approximate Joint Diagonalization According to the Natural Riemannian Distance.
Proceedings of the Latent Variable Analysis and Signal Separation, 2017

Variational-analysis look at combinatorial optimization, and other selected topics in optimization.
, 2017

Computational results of a semidefinite branch-and-bound algorithm for k-cluster.
Comput. Oper. Res., 2016

Decomposition algorithm for large-scale two-stage unit-commitment.
Ann. Oper. Res., 2016

Approximate joint diagonalization within the Riemannian geometry framework.
Proceedings of the 24th European Signal Processing Conference, 2016

Cut-Generating Functions and <i>S</i>-Free Sets.
Math. Oper. Res., 2015

Improved semidefinite bounding procedure for solving Max-Cut problems to optimality.
Math. Program., 2014

On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0-1 quadratic problems leading to quasi-Newton methods.
Math. Program., 2013

Prices stabilization for inexact unit-commitment problems.
Math. Methods Oper. Res., 2013

Cut-Generating Functions.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Projection-like Retractions on Matrix Manifolds.
SIAM J. Optim., 2012

Solving k-cluster problems to optimality with semidefinite programming.
Math. Program., 2012

A Fresh Variational-Analysis Look at the Positive Semidefinite Matrices World.
J. Optim. Theory Appl., 2012

Lifted coordinate descent for learning with trace-norm regularization.
Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

Descentwise inexact proximal algorithms for smooth optimization.
Comput. Optim. Appl., 2012

Large-scale image classification with trace-norm regularization.
Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012

Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions.
Optim. Methods Softw., 2011

Numerical Study of Semidefinite Bounds for the k-cluster Problem.
Electron. Notes Discret. Math., 2010

Regularization Methods for Semidefinite Programming.
SIAM J. Optim., 2009

Local Linear Convergence for Alternating and Averaged Nonconvex Projections.
Found. Comput. Math., 2009

Alternating Projections on Manifolds.
Math. Oper. Res., 2008

The spherical constraint in Boolean quadratic programs.
J. Glob. Optim., 2007

Newton methods for nonsmooth convex minimization: connections among U-Lagrangian, Riemannian Newton and SQP methods.
Math. Program., 2005

A Dual Approach to Semidefinite Least-Squares Problems.
SIAM J. Matrix Anal. Appl., 2004