conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Convex Optimization

591 papers

Papers per year

1
14
23
48
15
'05
'10
'15
'20
'25

Papers

A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation NIPS 2012
Fused sparsity and robust estimation for linear models with unknown variance NIPS 2012
Finding Exemplars from Pairwise Dissimilarities via Simultaneous Sparse Recovery NIPS 2012
Mirror Descent Meets Fixed Share (and feels no regret) NIPS 2012
A Stochastic Gradient Method with an Exponential Convergence _Rate for Finite Training Sets NIPS 2012
Forging The Graphs: A Low Rank and Positive Semidefinite Graph Learning Approach NIPS 2012
A Polynomial-time Form of Robust Regression NIPS 2012
Newton-Like Methods for Sparse Inverse Covariance Estimation NIPS 2012
Convergence Rate Analysis of MAP Coordinate Minimization Algorithms NIPS 2012
Stochastic Gradient Descent with Only One Projection NIPS 2012
A quasi-Newton proximal splitting method NIPS 2012
Globally Convergent Dual MAP LP Relaxation Solvers using Fenchel-Young Margins NIPS 2012
Perceptron Learning of SAT NIPS 2012
A Convex-Concave Relaxation Procedure Based Subgraph Matching Algorithm ACML 2012
Online Optimization with Gradual Variations COLT 2012
Random Design Analysis of Ridge Regression COLT 2012
A Conjugate Property between Loss Functions and Uncertainty Sets in Classification Problems COLT 2012
Restricted Strong Convexity and Weighted Matrix Completion: Optimal Bounds with Noise JMLR 2012
Efficient Methods for Overlapping Group Lasso NIPS 2011
Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation NIPS 2011
Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation NIPS 2011
Approximating Semidefinite Programs in Sublinear Time NIPS 2011
Stochastic convex optimization with bandit feedback NIPS 2011
Projection onto A Nonnegative Max-Heap NIPS 2011
Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization NIPS 2011