Donald Goldfarb

发表

Accelerated Linearized Bregman Method

Shiqian Ma, Bo Huang, Donald Goldfarb, 2011, J. Sci. Comput..

Anti-stalling pivot rules for the network simplex algorithm

Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai, 1990, Networks.

A relaxed version of Karmarkar's method

Sanjay Mehrotra, Donald Goldfarb, Sanjay Mehrotra, 1988, Math. Program..

Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization pdf

Shiqian Ma, Wei Liu, Xiao Wang, 2014, SIAM J. Optim..

Algorithms for solving some structured mathematical programs

Donald Goldfarb, Siyun Wang, 1992 .

Matrix factorizations in optimization of nonlinear functions subject to linear constraints — an addendum

Donald Goldfarb, 1977, Math. Program..

An alternating direction method for total variation denoising

Shiqian Ma, Donald Goldfarb, Zhiwei Qin, 2011, Optim. Methods Softw..

Interior Point Trajectories in Semidefinite Programming

Katya Scheinberg, Donald Goldfarb, D. Goldfarb, 1998, SIAM J. Optim..

Efficient dual simplex algorithms for the assignment problem

Donald Goldfarb, D. Goldfarb, 1986, Math. Program..

On the Complexity of a Class of Projective Interior Point Methods

Donald Goldfarb, Dong X. Shaw, D. Goldfarb, 1995, Math. Oper. Res..

A Faster Combinatorial Algorithm for the Generalized Circulation Problem

Donald Goldfarb, Zhiying Jin, 1996, Math. Oper. Res..

An O(n3L) primal—dual potential reduction algorithm for solving convex quadratic programs

Donald Goldfarb, Shucheng Liu, 1993, Math. Program..

Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization

Donald Goldfarb, Siyun Wang, D. Goldfarb, 1993, SIAM J. Optim..

A comparison of three total variation based texture extraction models

Wotao Yin, Stanley Osher, Donald Goldfarb, 2007, J. Vis. Commun. Image Represent..

Parametric Maximum Flow Algorithms for Fast Total Variation Minimization

Wotao Yin, Donald Goldfarb, D. Goldfarb, 2009, SIAM J. Sci. Comput..

Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions

Wenbo Gao, Donald Goldfarb, D. Goldfarb, 2016, Optim. Methods Softw..

Efficient algorithms for robust and stable principal component pursuit problems

Shiqian Ma, Necdet Serhat Aybat, Donald Goldfarb, 2013, Comput. Optim. Appl..

An interior-point piecewise linear penalty method for nonlinear programming

Donald Goldfarb, Lifeng Chen, D. Goldfarb, 2011, Math. Program..

Efficient dual simplex algorithms for the assignment problem

Donald Goldfarb, 1985, Math. Program..

On the convergence of an active-set method for ℓ1 minimization

Wotao Yin, Donald Goldfarb, Hongchao Zhang, 2012, Optim. Methods Softw..

A practicable steepest-edge simplex algorithm

Donald Goldfarb, John K. Reid, J. Reid, 1977, Math. Program..

Fast First-Order Methods for Composite Convex Optimization with Backtracking

Katya Scheinberg, Donald Goldfarb, Xi Bai, 2014, Found. Comput. Math..

On strongly polynomial dual simplex algorithms for the maximum flow problem

Wei Chen, Donald Goldfarb, 1997, Math. Program..

A Modified Barrier-Augmented Lagrangian Method for Constrained Minimization

Katya Scheinberg, Donald Goldfarb, R. Polyak, 1999, Comput. Optim. Appl..

Bregman Iterative Algorithms for (cid:2) 1 -Minimization with Applications to Compressed Sensing ∗

Wotao Yin, Jérôme Darbon, Stanley Osher, 2008 .

Image Cartoon-Texture Decomposition and Feature Selection Using the Total Variation Regularized L1 Functional

Wotao Yin, Stanley Osher, Donald Goldfarb, 2005, VLSM.

Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value

Sanjay Mehrotra, Donald Goldfarb, Sanjay Mehrotra, 1988, Math. Program..

Efficient Shortest Path Simplex Algorithms

Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai, 1990, Oper. Res..

Matrix factorizations in optimization of nonlinear functions subject to linear constraints

Donald Goldfarb, D. Goldfarb, 1976, Math. Program..

Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery pdf

Bo Huang, John Wright, Donald Goldfarb, 2013, ICML.

On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem

Donald Goldfarb, Jianxiu Hao, D. Goldfarb, 1993, Discret. Appl. Math..

An Iterative Regularization Method for Total Variation-Based Image Restoration

Wotao Yin, Stanley Osher, Martin Burger, 2005, Multiscale Model. Simul..

A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n2m) time

Donald Goldfarb, Jianxiu Hao, D. Goldfarb, 1990, Math. Program..

A polynomial dual simplex algorithm for the generalized circulation problem

Donald Goldfarb, Yiqing Lin, Zhiying Jin, 2002, Math. Program..

Noname manuscript No. (will be inserted by the editor) Efficient Block-coordinate Descent Algorithms for the Group Lasso

Katya Scheinberg, Donald Goldfarb, Zhiwei Qin, 2022 .

Exploiting special structure in a primal—dual path-following algorithm

Donald Goldfarb, In Chan Choi, D. Goldfarb, 1993, Math. Program..

Efficient Subsampled Gauss-Newton and Natural Gradient Methods for Training Neural Networks pdf

Yi Ren, Donald Goldfarb, Yi Ren, 2019, ArXiv.

A numerically stable dual method for solving strictly convex quadratic programs

Donald Goldfarb, Ashok U. Idnani, D. Goldfarb, 1983, Math. Program..

Using negative curvature in solving nonlinear programs

John Wright, Donald Goldfarb, Cun Mu, 2017, Comput. Optim. Appl..

An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem

Donald Goldfarb, Zhiying Jin, 1999, Oper. Res..

Generating conjugate directions without line searches using factorized variable metric updating formulas

Donald Goldfarb, D. Goldfarb, 1977, Math. Program..

Shortest path algorithms using dynamic breadth-first search

Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai, 1991, Networks.

A Curvilinear Search Method for p-Harmonic Flows on Spheres

Wotao Yin, Donald Goldfarb, Zaiwen Wen, 2009, SIAM J. Imaging Sci..

Block Coordinate Descent Methods for Semidefinite Programming

Katya Scheinberg, Donald Goldfarb, Zaiwen Wen, 2012 .

Efficient primal algorithms for strictly convex quadratic programs

Donald Goldfarb, D. Goldfarb, 1986 .

A Line Search Multigrid Method for Large-Scale Nonlinear Optimization

Donald Goldfarb, Zaiwen Wen, D. Goldfarb, 2009, SIAM J. Optim..

Product-form Cholesky factorization in interior point methods for second-order cone programming

Katya Scheinberg, Donald Goldfarb, D. Goldfarb, 2005, Math. Program..

Leader Stochastic Gradient Descent for Distributed Training of Deep Learning Models

Wenbo Gao, Donald Goldfarb, Adrian Weller, 2019, NeurIPS.

Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization

Shiqian Ma, Donald Goldfarb, D. Goldfarb, 2009, Found. Comput. Math..

Fast alternating linearization methods for minimizing the sum of two convex functions

Shiqian Ma, Katya Scheinberg, Donald Goldfarb, 2009, Math. Program..

Strongly polynomial dual simplex methods for the maximum flow problem

Ronald D. Armstrong, Wei Chen, Donald Goldfarb, 1998, Math. Program..

Robust Portfolio Selection Problems

Donald Goldfarb, Garud Iyengar, D. Goldfarb, 2003, Math. Oper. Res..

Linear Convergence of Stochastic Frank Wolfe Variants

Donald Goldfarb, Garud Iyengar, Chaoxu Zhou, 2017, AISTATS.

Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2

Donald Goldfarb, Lazaros Polymenakos, I. Ilkay Boduroglu, 1995, INFORMS J. Comput..

ADMM for multiaffine constrained optimization

Wenbo Gao, Donald Goldfarb, Frank E. Curtis, 2018, Optim. Methods Softw..

Practical Quasi-Newton Methods for Training Deep Neural Networks pdf

Donald Goldfarb, Yi Ren, Achraf Bahamou, 2020, NeurIPS.

l2-PENALTY METHODS FOR NONLINEAR PROGRAMMING WITH STRONG GLOBAL CONVERGENCE PROPERTIES

Donald Goldfarb, Lifeng Chen, D. Goldfarb, 2004 .

The Ellipsoid Method: A Survey

Michael J. Todd, Donald Goldfarb, Robert G. Bland, 1980 .

On the Bartels—Golub decomposition for linear programming bases

Donald Goldfarb, D. Goldfarb, 1977, Math. Program..

A computational comparison of the dinic and network simplex methods for maximum flow

Donald Goldfarb, Michael D. Grigoriadis, D. Goldfarb, 1988 .

2 A Variable-Splitting Augmented Lagrangian Framework pdf

Donald Goldfarb, Zhiwei Qin, D. Goldfarb, 2011 .

An O(n3L) primal interior point algorithm for convex quadratic programming

Donald Goldfarb, Shucheng Liu, D. Goldfarb, 1991, Math. Program..

Stochastic Adaptive Quasi-Newton Methods for Minimizing Expected Values

Wenbo Gao, Donald Goldfarb, Chaoxu Zhou, 2017, ICML.

Fixed point and Bregman iterative methods for matrix rank minimization

Shiqian Ma, Donald Goldfarb, Lifeng Chen, 2009, Math. Program..

Robust convex quadratically constrained programs

Donald Goldfarb, Garud Iyengar, D. Goldfarb, 2003, Math. Program..

A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation

Yin Zhang, Wotao Yin, Donald Goldfarb, 2010, SIAM J. Sci. Comput..

Polynomial-time primal simplex algorithms for the minimum cost network flow problem

Donald Goldfarb, Jianxiu Hao, 2005, Algorithmica.

Fast Multiple-Splitting Algorithms for Convex Optimization

Shiqian Ma, Donald Goldfarb, D. Goldfarb, 2009, SIAM J. Optim..

The Use of Negative Curvature in Minimization Algorithms

Donald Goldfarb, 1980 .

Modifications and implementation of the ellipsoid algorithm for linear programming

Michael J. Todd, Donald Goldfarb, M. Todd, 1982, Math. Program..

Steepest-edge simplex algorithms for linear programming

Donald Goldfarb, John J. H. Forrest, D. Goldfarb, 1992, Math. Program..

Alternating direction augmented Lagrangian methods for semidefinite programming

Wotao Yin, Donald Goldfarb, Zaiwen Wen, 2010, Math. Program. Comput..

Greedy Approaches to Symmetric Orthogonal Tensor Decomposition pdf

Donald Goldfarb, Daniel J. Hsu, Cun Mu, 2017, SIAM J. Matrix Anal. Appl..

Stochastic Block BFGS: Squeezing More Curvature out of Data

Robert M. Gower, Peter Richtárik, Donald Goldfarb, 2016, ICML.

Curvilinear path steplength algorithms for minimization which use directions of negative curvature

Donald Goldfarb, D. Goldfarb, 1980, Math. Program..

Worst case behavior of the steepest edge simplex method

William Y. Sit, Donald Goldfarb, D. Goldfarb, 1979, Discret. Appl. Math..

Feature Article - The Ellipsoid Method: A Survey

Michael J. Todd, Donald Goldfarb, Robert G. Bland, 1981, Oper. Res..

A primal projective interior point method for linear programming

Donald Goldfarb, Dong Xiao, D. Goldfarb, 1991, Math. Program..

A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming

Donald Goldfarb, Shucheng Liu, Siyun Wang, 1991, SIAM J. Optim..

Scalable Robust Matrix Recovery: Frank-Wolfe Meets Proximal Methods

John Wright, Donald Goldfarb, Yuqian Zhang, 2014, SIAM J. Sci. Comput..

Combinatorial interior point methods for generalized network flow problems

Donald Goldfarb, Yiqing Lin, 2002, Math. Program..

Second-order Cone Programming Methods for Total Variation-Based Image Restoration

Wotao Yin, Donald Goldfarb, D. Goldfarb, 2005, SIAM J. Sci. Comput..

Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors

Donald Goldfarb, Daniel J. Hsu, Cun Mu, 2015, SIAM J. Matrix Anal. Appl..

Robust Low-Rank Tensor Recovery: Models and Algorithms

Donald Goldfarb, Zhiwei Qin, D. Goldfarb, 2013, SIAM J. Matrix Anal. Appl..

A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming

Katya Scheinberg, Donald Goldfarb, D. Goldfarb, 2004, Math. Program..

Second-order cone programming

Donald Goldfarb, Farid Alizadeh, D. Goldfarb, 2003, Math. Program..

On strongly polynomial variants of the network simplex algorithm for the maximum flow problem

Donald Goldfarb, Jianxiu Hao, D. Goldfarb, 1991, Oper. Res. Lett..

The Total Variation Regularized L1 Model for Multiscale Decomposition

Wotao Yin, Stanley Osher, Donald Goldfarb, 2007, Multiscale Model. Simul..

A new scaling algorithm for the minimum cost network flow problem

Donald Goldfarb, Zhiying Jin, D. Goldfarb, 1999, Oper. Res. Lett..

A Dynamic Sampling Adaptive-SGD Method for Machine Learning pdf

Donald Goldfarb, Achraf Bahamou, 2019, ArXiv.

On the Complexity of the Simplex Method

Donald Goldfarb, D. Goldfarb, 1994 .

Sparse Inverse Covariance Selection via Alternating Linearization Methods

Shiqian Ma, Katya Scheinberg, Donald Goldfarb, 2010, NIPS.

Algorithms for the generalized network flow problem

Donald Goldfarb, Yiqing Lin, 2001 .

Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem

James B. Orlin, Donald Goldfarb, Zhiying Jin, 1997, Math. Oper. Res..

Block BFGS Methods

Wenbo Gao, Donald Goldfarb, D. Goldfarb, 2016, SIAM J. Optim..

Tensor Normal Training for Deep Learning Models pdf

Donald Goldfarb, Yi Ren, Yi Ren, 2021, NeurIPS.

Increasing Iterate Averaging for Solving Saddle-Point Problems

Donald Goldfarb, Christian Kroer, Yuan Gao, 2019, AAAI.

Algorithms for sparse and low-rank optimization: convergence, complexity and applications

Shiqian Ma, Donald Goldfarb, D. Goldfarb, 2011 .

Robust Active Portfolio Management

Donald Goldfarb, Garud Iyengar, E. Erdogan, 2008 .

Linear Programming

Michael J. Todd, Donald Goldfarb, 2004 .