The following pages link to Jérôme Malick (Q271985):
Displaying 48 items.
- Decomposition algorithm for large-scale two-stage unit-commitment (Q271986) (← links)
- Spectral (isotropic) manifolds and their dimension (Q279771) (← links)
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- A fresh variational-analysis look at the positive semidefinite matrices world (Q438781) (← links)
- Existence of a fixed point of a nonsmooth function arising in numerical mechanics (Q618876) (← links)
- Randomized progressive hedging methods for multi-stage stochastic programming (Q828821) (← links)
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications (Q829492) (← links)
- Local linear convergence for alternating and averaged nonconvex projections (Q839655) (← links)
- The spherical constraint in Boolean quadratic programs (Q925238) (← links)
- On the proximal gradient algorithm with alternated inertia (Q1752647) (← links)
- Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- Descentwise inexact proximal algorithms for smooth optimization (Q1935582) (← links)
- Superquantiles at work: machine learning applications and efficient subgradient computation (Q2070410) (← links)
- Asynchronous level bundle methods (Q2205980) (← links)
- Second-order differentiability of probability functions (Q2361140) (← links)
- Uncontrolled inexact information within bundle methods (Q2397754) (← links)
- Eventual convexity of probability constraints with elliptical distributions (Q2414898) (← links)
- Clarke generalized Jacobian of the projection onto the cone of positive semidefinite matrices (Q2432660) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods (Q2576738) (← links)
- Prices stabilization for inexact unit-commitment problems (Q2636928) (← links)
- Projection Methods in Conic Optimization (Q2802538) (← links)
- Numerical Study of Semidefinite Bounds for the k-cluster Problem (Q2883586) (← links)
- A formulation of the linear discrete Coulomb friction problem via convex optimization (Q3082189) (← links)
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions (Q3093033) (← links)
- BiqCrunch (Q3133583) (← links)
- Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems (Q3426228) (← links)
- (Q3530148) (← links)
- Sensitivity Analysis for Mirror-Stratifiable Convex Functions (Q4554065) (← links)
- Riemannian Optimization and Approximate Joint Diagonalization for Blind Source Separation (Q4622093) (← links)
- A Dual Approach to Semidefinite Least-Squares Problems (Q4650993) (← links)
- Cut-Generating Functions (Q4910810) (← links)
- Distributed Learning with Sparse Communications by Identification (Q4959464) (← links)
- Proximal Gradient Methods with Adaptive Subspace Sampling (Q5026438) (← links)
- On the Convexity of Level-sets of Probability Functions (Q5074513) (← links)
- Regularization Methods for Semidefinite Programming (Q5189563) (← links)
- Approximate Joint Diagonalization with Riemannian Optimization on the General Linear Group (Q5210994) (← links)
- A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm (Q5220423) (← links)
- Cut-Generating Functions and <i>S</i>-Free Sets (Q5252221) (← links)
- (Q5262219) (← links)
- Alternating Projections on Manifolds (Q5388078) (← links)
- (Q5480079) (← links)
- Newton acceleration on manifolds identified by proximal gradient methods (Q6044974) (← links)
- Harnessing Structure in Composite Nonsmooth Minimization (Q6046827) (← links)
- Regularization for Wasserstein distributionally robust optimization (Q6138461) (← links)
- Push–Pull With Device Sampling (Q6199904) (← links)
