Research graph
References from Convex Optimization: Algorithms and Complexity. Local targets link to admitted publications; unresolved targets remain external evidence.
A lower bound for the optimization of finite sums
2014 · External reference
Linear coupling: An ultimate unification of gradient and mirror descent
2014 · External reference
Towards a practical volumetric cutting plane method for convex programming
10.1137/s1052623497318013 · 1998 · External reference
Unresolved reference
2011 · External reference
Regret in online combinatorial optimization
10.1287/moor.2013.0598 · 2014 · External reference
10.1561/2200000039 · 2013 · Admitted local publication
Non-strongly-convex smooth stochastic approximation with convergence rate o(1/n)
2013 · External reference
Optimization with sparsity-inducing penalties
2012 · External reference
Sum of squares upper bounds, lower bounds, and open questions. Lecture Notes
2014 · External reference
Mirror Descent and nonlinear projected subgradient methods for convex optimization
10.1016/s0167-6377(02)00231-6 · 2003 · External reference
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
10.1137/080716542 · 2009 · External reference
Society for Industrial and Applied Mathematics (SIAM)
10.1137/1.9780898718829 · 2001 · External reference
Solving convex programs by random walks
10.1145/1008731.1008733 · 2004 · External reference
Unresolved reference
2004 · External reference
10.1561/2200000016 · 2011 · Admitted local publication
Introduction to online optimization
2011 · External reference
10.1561/2200000024 · 2012 · Admitted local publication
The entropic barrier: a simple and optimal universal self-concordant barrier
2014 · External reference
Sampling from a log-concave distribution with projected langevin monte carlo
2015 · External reference
A geometric alternative to nesterov’s accelerated gradient descent
2015 · External reference
Exact matrix completion via convex optimization
10.1007/s10208-009-9045-5 · 2009 · External reference
Méthode générale pour la résolution des systemes d’équations simultanées
1847 · External reference
Unresolved reference
2006 · External reference
A first-order primal-dual algorithm for convex problems with applications to imaging
10.1007/s10851-010-0251-1 · 2011 · External reference
Sublinear optimization for machine learning
10.1145/2371656.2371658 · 2012 · External reference
Introduction to Derivative-Free Optimization
10.1137/1.9780898718768 · 2009 · External reference
IEEE information theory society newsletter
1992 · External reference
Smooth optimization with approximate gradient
10.1137/060676386 · 2008 · External reference
Saga: A fast incremental gradient method with support for non-strongly convex composite objectives
2014 · External reference
Optimal distributed online prediction using mini-batches
2012 · External reference
Composite objective mirror descent
2010 · External reference
Conditional gradient algorithms with open loop step size rules
10.1016/0022-247x(78)90137-3 · 1978 · External reference
An algorithm for quadratic programming
10.1002/nav.3800030109 · 1956 · External reference
Exact regularization of convex programs
10.1137/060675320 · 2007 · External reference
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
10.1145/227683.227684 · 1995 · External reference
A sublinear-time randomized approximation algorithm for matrix games
10.1016/0167-6377(95)00032-0 · 1995 · External reference
Partitions of mass-distributions and of convex bodies by hyperplanes
10.2140/pjm.1960.10.1257 · 1960 · External reference
Unresolved reference
2001 · External reference
Unresolved reference
2011 · External reference
Revisiting frank-wolfe: Projection-free sparse convex optimization
2013 · External reference
Low-rank matrix completion using alternating minimization
10.1145/2488608.2488693 · 2013 · External reference
Accelerating stochastic gradient descent using predictive variance reduction
2013 · External reference
A simple lemma on greedy approximation in hilbert space and convergence rates for projection pursuit regression and neural network training
1992 · External reference
Unresolved reference
2011 · External reference
Unresolved reference
2011 · External reference
A new polynomial-time algorithm for linear programming
1984 · External reference
A simpler approach to obtaining an o (1/t) convergence rate for the projected stochastic subgradient method
2012 · External reference
A stochastic gradient method with an exponential convergence rate for strongly-convex optimization with finite training sets
2012 · External reference
Path finding i :solving linear programs with ÃŢ(sqrt(rank)) linear system solves
2013 · External reference
A faster cutting plane method and its implications for combinatorial and convex optimization
10.1109/focs.2015.68 · 2015 · External reference
On an algorithm for the minimization of convex functions
1965 · External reference
Hit-and-run mixes fast
1998 · External reference
Comment on: ℓ-penalization for mixture regression models
10.1007/s11749-010-0199-x · 2010 · External reference
A linear-time median-finding algorithm for projecting a vector on the simplex of rn
10.1016/0167-6377(89)90064-3 · 1989 · External reference
Orth-method for smooth convex optimization
1982 · External reference
Information-based complexity of convex programming
1995 · External reference
Prox-method with rate of convergence o (1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems
10.1137/s1052623403425629 · 2004 · External reference
Interior point polynomial time methods in convex programming
2004 · External reference
Problem Complexity and Method Efficiency in Optimization
1983 · External reference
A method of solving a convex programming problem with convergence rate o(1/k2)
1983 · External reference
Quality of semidefinite relaxation for nonconvex quadratic optimization. CORE Discussion Papers 1997019, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
1997 · External reference
Unresolved reference
2004 · External reference
Smooth minimization of non-smooth functions
10.1007/s10107-004-0552-5 · 2004 · External reference
Gradient methods for minimizing composite objective function. Core discussion papers, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)
2007 · External reference
Efficiency of coordinate descent methods on huge-scale optimization problems
10.1137/100802001 · 2012 · External reference
10.1137/1.9781611970791
10.1137/1.9781611970791 · 1994 · External reference
Location of the maximum on unimodal surfaces
10.1145/321281.321291 · 1965 · External reference
Numerical Optimization
2006 · External reference
Proximal algorithms
2013 · External reference
Lecture notes on online learning
2009 · External reference
A mathematical view of interior-point methods in convex optimization
2001 · External reference
Parallel coordinate descent methods for big data optimization
2012 · External reference
A stochastic approximation method
10.1214/aoms/1177729586 · 1951 · External reference
10.1515/9781400873173
10.1515/9781400873173 · 1970 · External reference
Random vectors in the isotropic position
10.1006/jfan.1998.3384 · 1999 · External reference
Convergence rates of inexact proximalgradient methods for convex optimization
2011 · External reference
Unresolved reference
2002 · External reference
Unresolved reference
2014 · External reference
Stochastic dual coordinate ascent methods for regularized loss minimization
2013 · External reference
Accelerated mini-batch stochastic dual coordinate ascent
2013 · External reference
A differential equation for modeling nesterov’s accelerated gradient method: Theory and insights
2014 · External reference
Regression shrinkage and selection via the lasso
10.1111/j.2517-6161.1996.tb02080.x · 1996 · External reference
On accelerated proximal gradient methods for convex-concave optimization
2008 · External reference
Optimal rates of aggregation
2003 · External reference
A new algorithm for minimizing convex functions over convex sets
10.1109/sfcs.1989.63500 · 1989 · External reference
A new algorithm for minimizing convex functions over convex sets
10.1007/bf02592216 · 1996 · External reference
Sparse reconstruction by separable approximation
10.1109/tsp.2009.2016892 · 2009 · External reference
Dual averaging methods for regularized stochastic learning and online optimization
2010 · External reference
Stochastic primal-dual coordinate method for regularized empirical risk minimization
2014 · External reference
