| Publication | Date of Publication | Type |
|---|
Exact convergence rate of the last iterate in subgradient methods
SIAM Journal on Optimization | 2025-10-10 | Paper |
Proximal gradient methods with inexact oracle of degree q for composite optimization
Optimization Letters | 2025-06-24 | Paper |
PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python
Mathematical Programming Computation | 2024-11-29 | Paper |
Optimal inexactness schedules for tunable oracle-based methods
Optimization Methods & Software | 2024-11-20 | Paper |
Least-squares methods for nonnegative matrix factorization over rational functions
IEEE Transactions on Signal Processing | 2024-09-12 | Paper |
Interpolation conditions for linear operators and applications to performance estimation problems
SIAM Journal on Optimization | 2024-09-10 | Paper |
| Optimal inexactness schedules for Tunable Oracle based Methods | 2023-09-14 | Paper |
Conic optimization-based algorithms for nonnegative matrix factorization
Optimization Methods & Software | 2023-08-09 | Paper |
| Exact convergence rate of the last iterate in subgradient methods | 2023-07-20 | Paper |
| On the Worst-Case Analysis of Cyclic Coordinate-Wise Algorithms on Smooth Convex Functions | 2022-11-30 | Paper |
New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition
SIAM Journal on Matrix Analysis and Applications | 2022-06-03 | Paper |
| Tight convergence rates of the gradient method on smooth hypoconvex functions | 2022-03-01 | Paper |
A geometric lower bound on the extension complexity of polytopes based on the f-vector
Discrete Applied Mathematics | 2021-09-15 | Paper |
Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation
SIAM Journal on Optimization | 2020-08-18 | Paper |
Linear convergence of first order methods for non-strongly convex optimization
Mathematical Programming. Series A. Series B | 2019-05-17 | Paper |
Extended formulations for order polytopes through network flows
Journal of Mathematical Psychology | 2019-03-29 | Paper |
Extended formulations for order polytopes through network flows
Journal of Mathematical Psychology | 2019-03-29 | Paper |
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
Optimization Methods & Software | 2019-02-18 | Paper |
A dynamic programming approach to multi-period planning of isolated microgrids
Trends in Mathematics | 2018-10-11 | Paper |
Algorithms for positive semidefinite factorization
Computational Optimization and Applications | 2018-10-02 | Paper |
Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
Journal of Optimization Theory and Applications | 2018-09-04 | Paper |
Weighted Sum Rate Maximization for Downlink OFDMA With Subcarrier-Pair Based Opportunistic DF Relaying
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
Optimization Letters | 2017-11-09 | Paper |
An efficient sampling method for regression-based polynomial chaos expansion
Communications in Computational Physics | 2017-10-27 | Paper |
Random block coordinate descent methods for linearly constrained optimization over networks
Journal of Optimization Theory and Applications | 2017-09-01 | Paper |
Exact worst-case performance of first-order methods for composite convex optimization
SIAM Journal on Optimization | 2017-07-11 | Paper |
| A robust convex optimization framework for autonomous network planning under load uncertainty | 2017-03-20 | Paper |
On the linear extension complexity of regular n-gons
Linear Algebra and its Applications | 2017-03-03 | Paper |
Smooth strongly convex interpolation and exact worst-case performance of first-order methods
Mathematical Programming. Series A. Series B | 2017-02-03 | Paper |
Heuristics for exact nonnegative matrix factorization
Journal of Global Optimization | 2016-05-25 | Paper |
Extended Lanczos bidiagonalization algorithm for low rank approximation and its applications
Journal of Computational and Applied Mathematics | 2016-03-03 | Paper |
A continuous characterization of the maximum-edge biclique problem
Journal of Global Optimization | 2014-09-18 | Paper |
First-order methods of smooth convex optimization with inexact oracle
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
On the geometric interpretation of the nonnegative rank
Linear Algebra and its Applications | 2012-11-09 | Paper |
Double smoothing technique for large-scale linearly constrained convex optimization
SIAM Journal on Optimization | 2012-09-12 | Paper |
A multilevel approach for nonnegative matrix factorization
Journal of Computational and Applied Mathematics | 2012-04-24 | Paper |
Low-rank matrix approximation with weights or missing data is NP-hard
SIAM Journal on Matrix Analysis and Applications | 2012-03-21 | Paper |
| An extended conic formulation for geometric optimization | 2011-01-28 | Paper |
ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements
European Journal of Operational Research | 2010-06-11 | Paper |
Using underapproximations for sparse nonnegative matrix factorization
Pattern Recognition | 2010-04-07 | Paper |
An interior-point method for the single-facility location problem with mixed norms using a conic formulation
Mathematical Methods of Operations Research | 2009-01-30 | Paper |
| Nonnegative Factorization and The Maximum Edge Biclique Problem | 2008-10-23 | Paper |
Conic formulation for l_p-norm optimization
Journal of Optimization Theory and Applications | 2005-01-17 | Paper |
| scientific article; zbMATH DE number 1900177 (Why is no real title available?) | 2003-04-23 | Paper |
Improving complexity of structured convex optimization problems using self-concordant barriers
European Journal of Operational Research | 2002-11-20 | Paper |
Proving strong duality for geometric optimization using a conic formulation
Annals of Operations Research | 2002-03-26 | Paper |
| scientific article; zbMATH DE number 1975312 (Why is no real title available?) | 2001-01-01 | Paper |
Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
(available as arXiv preprint) | N/A | Paper |
Proximal gradient methods with inexact oracle of degree q for composite optimization
(available as arXiv preprint) | N/A | Paper |
On the Set of Possible Minimizers of a Sum of Convex Functions
(available as arXiv preprint) | N/A | Paper |
Comparison of Proximal First-Order Primal and Primal-Dual algorithms via Performance Estimation
(available as arXiv preprint) | N/A | Paper |
Improved convergence rates for the Difference-of-Convex algorithm
(available as arXiv preprint) | N/A | Paper |
