conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Continuous Optimization

3,907 papers

Papers per year

6
38
155
367
154
'05
'10
'15
'20
'25

Papers

Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning NIPS 2011
A Non-Parametric Approach to Dynamic Programming NIPS 2011
Learning Auto-regressive Models from Sequence and Non-sequence Data NIPS 2011
Projection onto A Nonnegative Max-Heap NIPS 2011
Signal Estimation Under Random Time-Warpings and Nonlinear Signal Alignment NIPS 2011
Penalty Decomposition Methods for Rank Minimization NIPS 2011
Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization NIPS 2011
Clustered Multi-Task Learning Via Alternating Structure Optimization NIPS 2011
Statistical Performance of Convex Tensor Decomposition NIPS 2011
Better Mini-Batch Algorithms via Accelerated Gradient Methods NIPS 2011
Energetically Optimal Action Potentials NIPS 2011
Thinning Measurement Models and Questionnaire Design NIPS 2011
Shaping Level Sets with Submodular Functions NIPS 2011
Sparse recovery by thresholded non-negative least squares NIPS 2011
Universal low-rank matrix recovery from Pauli measurements NIPS 2011
On the accuracy of l1-filtering of signals with block-sparse structure NIPS 2011
Greedy Algorithms for Structurally Constrained High Dimensional Problems NIPS 2011
Approximate Model Selection for Large Scale LSSVM ACML 2011
Learning Scale Free Networks by Reweighted $\ell_1$ regularization AISTATS 2011
Statistical Optimization of Non-Negative Matrix Factorization AISTATS 2011
A novel greedy algorithm for Nyström approximation AISTATS 2011
Convergent Decomposition Solvers for Tree-reweighted Free Energies AISTATS 2011
Convex envelopes of complexity controlling penalties: the case against premature envelopment AISTATS 2011
A Fast Algorithm for Recovery of Jointly Sparse Vectors based on the Alternating Direction Methods AISTATS 2011
CAKE: Convex Adaptive Kernel Density Estimation AISTATS 2011