• Publications
  • Influence
Numerical Optimization
TLDR
Numerical Optimization presents a comprehensive and up-to-date description of the most effective methods in continuous optimization. Expand
  • 10,331
  • 830
  • PDF
Hogwild: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
TLDR
We show that when the associated optimization problem is sparse, meaning most gradient updates only modify a small part of the decision variable, then HOGWILD! achieves a nearly optimal rate of convergence. Expand
  • 1,829
  • 286
  • PDF
Numerical Optimization (Springer Series in Operations Research and Financial Engineering)
TLDR
Optimization is an important tool used in decision science and for the analysis of physical systems . Expand
  • 2,066
  • 174
Primal-Dual Interior-Point Methods
  • Stephen J. Wright
  • Mathematics, Computer Science
  • Other Titles in Applied Mathematics
  • 1997
Preface Notation 1. Introduction. Linear Programming Primal-Dual Methods The Central Path A Primal-Dual Framework Path-Following Methods Potential-Reduction Methods Infeasible Starting PointsExpand
  • 2,123
  • 158
  • PDF
Sparse Reconstruction by Separable Approximation
TLDR
We present an algorithmic framework for the more general problem of minimizing the sum of a smooth convex function and a nonsmooth, possibly nonconvex regularizer. Expand
  • 1,333
  • 153
  • PDF
Computational Methods for Sparse Solution of Linear Inverse Problems
TLDR
The goal of the sparse approximation problem is to approximate a target signal using a linear combination of a few elementary signals drawn from a fixed collection. Expand
  • 1,026
  • 57
  • PDF
Power Awareness in Network Design and Routing
TLDR
We investigate the potential for significant power savings in operational networks by including power-awareness in the design and configuration of networks, and in the implementation of network protocols. Expand
  • 758
  • 53
  • PDF
Coordinate descent algorithms
TLDR
This paper describes the fundamentals of the coordinate descent approach, together with variants and extensions and their convergence properties, mostly with reference to convex objectives. Expand
  • 731
  • 50
  • PDF
Application of Interior-Point Methods to Model Predictive Control
We present a structured interior-point method for the efficient solution of the optimal control problem in model predictive control. The cost of this approach is linear in the horizon length,Expand
  • 515
  • 40
  • PDF
Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
TLDR
We describe an asynchronous parallel stochastic proximal coordinate descent algorithm for minimizing a composite objective function, which consists of a smooth convex function added to a separable convexfunction. Expand
  • 212
  • 29
  • PDF
...
1
2
3
4
5
...