← Optimization
Mathematics & Optimization › Optimization ›

Convex Optimization

589 directly classified papers

Papers per year

Papers

Fast Graph Laplacian Regularized Kernel Learning via Semidefinite–Quadratic–Linear Programming NIPS 2009
On the Convergence of the Concave-Convex Procedure NIPS 2009
Dual Averaging Method for Regularized Stochastic Learning and Online Optimization NIPS 2009
Convex Relaxation of Mixture Regression with Efficient Algorithms NIPS 2009
Efficient Learning using Forward-Backward Splitting NIPS 2009
Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization NIPS 2009
Efficient Recovery of Jointly Sparse Vectors NIPS 2009
Accelerated Gradient Methods for Stochastic Optimization and Online Learning NIPS 2009
Fast Rates for Regularized Objectives NIPS 2008
Clustered Multi-Task Learning: A Convex Formulation NIPS 2008
Robust Regression and Lasso NIPS 2008
Multi-stage Convex Relaxation for Learning with Sparse Regularization NIPS 2008
PSDBoost: Matrix-Generation Linear Programming for Positive Semidefinite Matrices Learning NIPS 2008
An Extended Level Method for Efficient Multiple Kernel Learning NIPS 2008
Supervised Exponential Family Principal Component Analysis via Convex Optimization NIPS 2008
Convex Learning with Invariances NIPS 2007
Estimating divergence functionals and the likelihood ratio by penalized convex risk minimization NIPS 2007
Boosting Algorithms for Maximizing the Soft Margin NIPS 2007
Hierarchical Penalization NIPS 2007
A Constraint Generation Approach to Learning Stable Linear Dynamical Systems NIPS 2007
Ensemble Clustering using Semidefinite Programming NIPS 2007
Predictive Matrix-Variate t Models NIPS 2007
An Analysis of Convex Relaxations for MAP Estimation NIPS 2007
Adaptive Online Gradient Descent NIPS 2007
Bundle Methods for Machine Learning NIPS 2007