| Publication | Date of Publication | Type |
|---|
| The rate of convergence of Bregman proximal methods: local geometry versus regularity versus sharpness | 2024-07-16 | Paper |
| Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective | 2024-07-08 | Paper |
| Push–Pull With Device Sampling | 2024-02-29 | Paper |
| Harnessing Structure in Composite Nonsmooth Minimization | 2023-09-06 | Paper |
| Regularization for Wasserstein distributionally robust optimization | 2023-09-05 | Paper |
| Newton acceleration on manifolds identified by proximal gradient methods | 2023-05-25 | Paper |
| On the Convexity of Level-sets of Probability Functions | 2022-05-09 | Paper |
| Proximal Gradient Methods with Adaptive Subspace Sampling | 2022-02-08 | Paper |
| Superquantiles at work: machine learning applications and efficient subgradient computation | 2022-01-24 | Paper |
| Superquantile-based learning: a direct approach using gradient-based optimization | 2022-01-03 | Paper |
| Superquantiles at Work: Machine Learning Applications and Efficient Subgradient Computation | 2022-01-03 | Paper |
| Distributed Learning with Sparse Communications by Identification | 2021-09-13 | Paper |
| Nonsmoothness in machine learning: specific structure, proximal identification, and applications | 2021-05-06 | Paper |
| Randomized progressive hedging methods for multi-stage stochastic programming | 2021-05-05 | Paper |
| Chance constrained problems: a bilevel convex optimization perspective | 2021-03-19 | Paper |
| Asynchronous level bundle methods | 2020-10-21 | Paper |
| A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm | 2020-03-23 | Paper |
| Approximate Joint Diagonalization with Riemannian Optimization on the General Linear Group | 2020-01-17 | Paper |
| Eventual convexity of probability constraints with elliptical distributions | 2019-05-17 | Paper |
| Riemannian Optimization and Approximate Joint Diagonalization for Blind Source Separation | 2019-02-12 | Paper |
| Sensitivity Analysis for Mirror-Stratifiable Convex Functions | 2018-11-07 | Paper |
| Regularized decomposition of large scale block-structured robust optimization problems | 2018-10-10 | Paper |
| On the proximal gradient algorithm with alternated inertia | 2018-05-24 | Paper |
| Model Consistency for Learning with Mirror-Stratifiable Regularizers | 2018-03-22 | Paper |
| BiqCrunch | 2018-02-05 | Paper |
| On the Proximal Gradient Algorithm with Alternated Inertia | 2018-01-17 | Paper |
| Second-order differentiability of probability functions | 2017-06-29 | Paper |
| Uncontrolled inexact information within bundle methods | 2017-05-23 | Paper |
| Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster | 2016-11-17 | Paper |
| Spectral (isotropic) manifolds and their dimension | 2016-04-29 | Paper |
| Projection Methods in Conic Optimization | 2016-04-26 | Paper |
| Decomposition algorithm for large-scale two-stage unit-commitment | 2016-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5262219 | 2015-07-13 | Paper |
| Cut-Generating Functions and S-Free Sets | 2015-05-29 | Paper |
| Improved semidefinite bounding procedure for solving max-cut problems to optimality | 2014-02-25 | Paper |
| Prices stabilization for inexact unit-commitment problems | 2014-02-18 | Paper |
| On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods | 2013-08-12 | Paper |
| Cut-Generating Functions | 2013-03-19 | Paper |
| Descentwise inexact proximal algorithms for smooth optimization | 2013-02-18 | Paper |
| Solving \(k\)-cluster problems to optimality with semidefinite programming | 2012-12-19 | Paper |
| Locally symmetric submanifolds lift to spectral manifolds | 2012-12-17 | Paper |
| A fresh variational-analysis look at the positive semidefinite matrices world | 2012-07-31 | Paper |
| Numerical study of semidefinite bounds for the \(k\)-cluster problem | 2012-05-13 | Paper |
| Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions | 2011-10-12 | Paper |
| A formulation of the linear discrete Coulomb friction problem via convex optimization | 2011-03-09 | Paper |
| Existence of a fixed point of a nonsmooth function arising in numerical mechanics | 2011-01-17 | Paper |
| Regularization Methods for Semidefinite Programming | 2010-03-17 | Paper |
| Local linear convergence for alternating and averaged nonconvex projections | 2009-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530148 | 2008-10-15 | Paper |
| The spherical constraint in Boolean quadratic programs | 2008-06-03 | Paper |
| Alternating Projections on Manifolds | 2008-05-27 | Paper |
| SDLS: a Matlab package for solving conic least-squares problems | 2007-09-17 | Paper |
| Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems | 2007-03-08 | Paper |
| Clarke generalized Jacobian of the projection onto the cone of positive semidefinite matrices | 2006-10-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480079 | 2006-07-25 | Paper |
| Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods | 2005-12-14 | Paper |
| A Dual Approach to Semidefinite Least-Squares Problems | 2005-02-21 | Paper |
| Delay-tolerant distributed Bregman proximal algorithms | N/A | Paper |
