| Publication | Date of Publication | Type |
|---|
| PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python | 2024-11-29 | Paper |
| Optimal inexactness schedules for tunable oracle-based methods | 2024-11-20 | Paper |
| Least-squares methods for nonnegative matrix factorization over rational functions | 2024-09-12 | Paper |
| Interpolation conditions for linear operators and applications to performance estimation problems | 2024-09-10 | Paper |
| Optimal inexactness schedules for Tunable Oracle based Methods | 2023-09-14 | Paper |
| Conic optimization-based algorithms for nonnegative matrix factorization | 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 | 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 | 2021-09-15 | Paper |
| Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation | 2020-08-18 | Paper |
| Linear convergence of first order methods for non-strongly convex optimization | 2019-05-17 | Paper |
| Extended formulations for order polytopes through network flows | 2019-03-29 | Paper |
| Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming | 2019-02-18 | Paper |
| A Dynamic Programming Approach to Multi-period Planning of Isolated Microgrids | 2018-10-11 | Paper |
| Algorithms for positive semidefinite factorization | 2018-10-02 | Paper |
| Exact worst-case convergence rates of the proximal gradient method for composite convex minimization | 2018-09-04 | Paper |
| Weighted Sum Rate Maximization for Downlink OFDMA With Subcarrier-Pair Based Opportunistic DF Relaying | 2018-08-22 | Paper |
| On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions | 2017-11-09 | Paper |
| An Efficient Sampling Method for Regression-Based Polynomial Chaos Expansion | 2017-10-27 | Paper |
| Random block coordinate descent methods for linearly constrained optimization over networks | 2017-09-01 | Paper |
| Exact Worst-Case Performance of First-Order Methods for Composite Convex 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 | 2017-03-03 | Paper |
| Smooth strongly convex interpolation and exact worst-case performance of first-order methods | 2017-02-03 | Paper |
| Heuristics for exact nonnegative matrix factorization | 2016-05-25 | Paper |
| Extended Lanczos bidiagonalization algorithm for low rank approximation and its applications | 2016-03-03 | Paper |
| A continuous characterization of the maximum-edge biclique problem | 2014-09-18 | Paper |
| First-order methods of smooth convex optimization with inexact oracle | 2014-08-29 | Paper |
| On the geometric interpretation of the nonnegative rank | 2012-11-09 | Paper |
| Double smoothing technique for large-scale linearly constrained convex optimization | 2012-09-12 | Paper |
| A multilevel approach for nonnegative matrix factorization | 2012-04-24 | Paper |
| Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard | 2012-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3070934 | 2011-01-28 | Paper |
| ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements | 2010-06-11 | Paper |
| Using underapproximations for sparse nonnegative matrix factorization | 2010-04-07 | Paper |
| An interior-point method for the single-facility location problem with mixed norms using a conic formulation | 2009-01-30 | Paper |
| Nonnegative Factorization and The Maximum Edge Biclique Problem | 2008-10-23 | Paper |
| Conic formulation for \(l_p\)-norm optimization | 2005-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4803007 | 2003-04-23 | Paper |
| Improving complexity of structured convex optimization problems using self-concordant barriers | 2002-11-20 | Paper |
| Proving strong duality for geometric optimization using a conic formulation | 2002-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4424548 | 2001-01-01 | Paper |
| Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems | N/A | Paper |
| Proximal gradient methods with inexact oracle of degree q for composite optimization | N/A | Paper |
| On the Set of Possible Minimizers of a Sum of Convex Functions | N/A | Paper |
| Comparison of Proximal First-Order Primal and Primal-Dual algorithms via Performance Estimation | N/A | Paper |
| Improved convergence rates for the Difference-of-Convex algorithm | N/A | Paper |
