Convex Optimization
864 papers
Papers per year
1
1
11
17
10
16
23
22
35
59
54
39
34
27
35
48
63
52
74
51
88
83
21
'5
'10
'15
'20
'25
Papers
Trading Computation for Communication: Distributed Stochastic Dual Coordinate Ascent
NeurIPS 2013
Tree Shape Priors with Connectivity Constraints Using Convex Relaxation on General Graphs
ICCV 2013
Unifying Nuclear Norm and Bilinear Factorization Approaches for Low-Rank Matrix Decomposition
ICCV 2013
Accelerated Training for Matrix-norm Regularization: A Boosting Approach
NeurIPS 2012
A Conjugate Property between Loss Functions and Uncertainty Sets in Classification Problems
COLT 2012
A Convex-Concave Relaxation Procedure Based Subgraph Matching Algorithm
ACML 2012
A Convex Formulation for Learning Scale-Free Networks via Submodular Relaxation
NeurIPS 2012
A Polynomial-time Form of Robust Regression
NeurIPS 2012
Approximating Concavely Parameterized Optimization Problems
NeurIPS 2012
A quasi-Newton proximal splitting method
NeurIPS 2012
A Stochastic Gradient Method with an Exponential Convergence _Rate for Finite Training Sets
NeurIPS 2012
Calibrated Elastic Regularization in Matrix Completion
NeurIPS 2012
Communication/Computation Tradeoffs in Consensus-Based Distributed Optimization
NeurIPS 2012
Compressive Sensing MRI with Wavelet Tree Sparsity
NeurIPS 2012
Convergence Rate Analysis of MAP Coordinate Minimization Algorithms
NeurIPS 2012
Convex Multi-view Subspace Learning
NeurIPS 2012
CPRL -- An Extension of Compressive Sensing to the Phase Retrieval Problem
NeurIPS 2012
Exact and Stable Recovery of Sequences of Signals with Sparse Increments via Differential _1-Minimization
NeurIPS 2012
Factoring nonnegative matrices with linear programs
NeurIPS 2012
Finding Exemplars from Pairwise Dissimilarities via Simultaneous Sparse Recovery
NeurIPS 2012
Forging The Graphs: A Low Rank and Positive Semidefinite Graph Learning Approach
NeurIPS 2012
Fused sparsity and robust estimation for linear models with unknown variance
NeurIPS 2012
Globally Convergent Dual MAP LP Relaxation Solvers using Fenchel-Young Margins
NeurIPS 2012
Mirror Descent Meets Fixed Share (and feels no regret)
NeurIPS 2012
Multiclass Learning with Simplex Coding
NeurIPS 2012