Skip to content
conftrace_

Convex Optimization

864 papers

1
23
39
63
83
'5
'10
'15
'20
'25

Papers

Designing Illuminant Spectral Power Distributions for Surface Classification CVPR 2017 Distributed Accelerated Proximal Coordinate Gradient Methods IJCAI 2017 Exploiting Strong Convexity from Data with Primal-Dual First-Order Algorithms ICML 2017 Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe NeurIPS 2017 FFTLasso: Large-Scale LASSO in the Fourier Domain CVPR 2017 Frame-based Data Factorizations ICML 2017 Generalized Conditional Gradient for Sparse Estimation JMLR 2017 Geometric Descent Method for Convex Composite Minimization NeurIPS 2017 Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences NeurIPS 2017 Limitations on Variance-Reduction and Acceleration Schemes for Finite Sums Optimization NeurIPS 2017 Online to Offline Conversions, Universality and Adaptive Minibatch Sizes NeurIPS 2017 Optimal Algorithms for Smooth and Strongly Convex Distributed Optimization in Networks ICML 2017 Optimized Pre-Processing for Discrimination Prevention NeurIPS 2017 SnapVX: A Network-Based Convex Optimization Solver JMLR 2017 SVD-free Convex-Concave Approaches for Nuclear Norm Regularization IJCAI 2017 Truncated Max-Of-Convex Models CVPR 2017 When Cyclic Coordinate Descent Outperforms Randomized Coordinate Descent NeurIPS 2017 A Convex Atomic-Norm Approach to Multiple Sequence Alignment and Motif Discovery ICML 2016 Adaptive Algorithms for Online Convex Optimization with Long-term Constraints ICML 2016 A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights JMLR 2016 Algorithms and matching lower bounds for approximately-convex optimization NeurIPS 2016 An equivalence between high dimensional Bayes optimal inference and M-estimation NeurIPS 2016 A Simple Practical Accelerated Method for Finite Sums NeurIPS 2016 Asynchronous Parallel Greedy Coordinate Descent NeurIPS 2016 Black-box Optimization with a Politician ICML 2016