The following pages link to François Glineur (Q237953):
Displaying 48 items.
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods (Q507324) (← links)
- On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
- (Q702371) (redirect page) (← links)
- Conic formulation for \(l_p\)-norm optimization (Q702372) (← links)
- A continuous characterization of the maximum-edge biclique problem (Q742133) (← links)
- Using underapproximations for sparse nonnegative matrix factorization (Q962750) (← links)
- ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements (Q976334) (← links)
- An interior-point method for the single-facility location problem with mixed norms using a conic formulation (Q999133) (← links)
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization (Q1670100) (← links)
- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (Q1679617) (← links)
- Extended formulations for order polytopes through network flows (Q1736010) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- Algorithms for positive semidefinite factorization (Q1790680) (← links)
- Improving complexity of structured convex optimization problems using self-concordant barriers (Q1848383) (← links)
- A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector (Q1983109) (← links)
- Random block coordinate descent methods for linearly constrained optimization over networks (Q2401516) (← links)
- Linear convergence of first order methods for non-strongly convex optimization (Q2414900) (← links)
- A multilevel approach for nonnegative matrix factorization (Q2428091) (← links)
- Double smoothing technique for large-scale linearly constrained convex optimization (Q2910891) (← links)
- (Q3070934) (← links)
- Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard (Q3225532) (← links)
- (Q4424548) (← links)
- Weighted Sum Rate Maximization for Downlink OFDMA With Subcarrier-Pair Based Opportunistic DF Relaying (Q4578534) (← links)
- An Efficient Sampling Method for Regression-Based Polynomial Chaos Expansion (Q4588786) (← links)
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887) (← links)
- A Dynamic Programming Approach to Multi-period Planning of Isolated Microgrids (Q4687399) (← links)
- (Q4803007) (← links)
- Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation (Q5116548) (← links)
- Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization (Q5275297) (← links)
- New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition (Q5863880) (← links)
- Proving strong duality for geometric optimization using a conic formulation (Q5959331) (← links)
- Extended Lanczos bidiagonalization algorithm for low rank approximation and its applications (Q5965351) (← links)
- Conic optimization-based algorithms for nonnegative matrix factorization (Q6113533) (← links)
- Optimal inexactness schedules for Tunable Oracle based Methods (Q6451159) (← links)
- Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems (Q6508865) (← links)
- Proximal gradient methods with inexact oracle of degree q for composite optimization (Q6518106) (← links)
- On the Set of Possible Minimizers of a Sum of Convex Functions (Q6525279) (← links)
- Comparison of Proximal First-Order Primal and Primal-Dual algorithms via Performance Estimation (Q6526252) (← links)
- Improved convergence rates for the Difference-of-Convex algorithm (Q6527594) (← links)
- Interpolation conditions for linear operators and applications to performance estimation problems (Q6601207) (← links)
- Least-squares methods for nonnegative matrix factorization over rational functions (Q6603534) (← links)
- Optimal inexactness schedules for tunable oracle-based methods (Q6641000) (← links)
- PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python (Q6645946) (← links)
- Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions (Q6733986) (← links)
- Exact Convergence rate of the subgradient method by using Polyak step size (Q6737379) (← links)
- Global minimization of a minimum of a finite collection of functions (Q6756821) (← links)
