Search the dblp DataBase
Donald Goldfarb :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Wotao Yin , Donald Goldfarb , Stanley Osher Image Cartoon-Texture Decomposition and Feature Selection Using the Total Variation Regularized L1 Functional. [Citation Graph (0, 0)][DBLP ] VLSM, 2005, pp:73-84 [Conf ] Donald Goldfarb , Jianxiu Hao Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1992, v:8, n:2, pp:145-160 [Journal ] Donald Goldfarb , Jianxiu Hao On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1993, v:47, n:1, pp:9-16 [Journal ] Donald Goldfarb , Garud Iyengar Robust Portfolio Selection Problems. [Citation Graph (0, 0)][DBLP ] Math. Oper. Res., 2003, v:28, n:1, pp:1-38 [Journal ] Farid Alizadeh , Donald Goldfarb Second-order cone programming. [Citation Graph (0, 0)][DBLP ] Math. Program., 2003, v:95, n:1, pp:3-51 [Journal ] Ronald D. Armstrong , Wei Chen , Donald Goldfarb , Zhiying Jin Strongly polynomial dual simplex methods for the maximum flow problem. [Citation Graph (0, 0)][DBLP ] Math. Program., 1998, v:80, n:, pp:17-33 [Journal ] L. Chen , Donald Goldfarb Interior-point l2 -penalty methods for nonlinear programming with strong global convergence properties. [Citation Graph (0, 0)][DBLP ] Math. Program., 2006, v:108, n:1, pp:1-36 [Journal ] In Chan Choi , Donald Goldfarb Exploiting special structure in a primal-dual path-following algorithm. [Citation Graph (0, 0)][DBLP ] Math. Program., 1993, v:58, n:, pp:33-52 [Journal ] John J. Forrest , Donald Goldfarb Steepest-edge simplex algorithms for linear programming. [Citation Graph (0, 0)][DBLP ] Math. Program., 1992, v:57, n:, pp:341-374 [Journal ] Donald Goldfarb , Wei Chen On strongly polynomial dual simplex algorithms for the maximum flow problem. [Citation Graph (0, 0)][DBLP ] Math. Program., 1997, v:77, n:, pp:159-168 [Journal ] Donald Goldfarb , Jianxiu Hao A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at most nm Pivots and O(n2 m) Time. [Citation Graph (0, 0)][DBLP ] Math. Program., 1990, v:47, n:, pp:353-365 [Journal ] Donald Goldfarb , S. Liu An O(n3 L) primal interior point algorithm for convex quadratic programming. [Citation Graph (0, 0)][DBLP ] Math. Program., 1991, v:49, n:, pp:325-340 [Journal ] Donald Goldfarb , Shucheng Liu An O(n3 L) primal-dual potential reduction algorithm for solving convex quadratic programs. [Citation Graph (0, 0)][DBLP ] Math. Program., 1993, v:61, n:, pp:161-170 [Journal ] Donald Goldfarb , K. Scheinberg A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming. [Citation Graph (0, 0)][DBLP ] Math. Program., 2004, v:99, n:1, pp:1-34 [Journal ] Donald Goldfarb , K. Scheinberg Product-form Cholesky factorization in interior point methods for second-order cone programming. [Citation Graph (0, 0)][DBLP ] Math. Program., 2005, v:103, n:1, pp:153-179 [Journal ] Donald Goldfarb , Dong Xiao A primal projective interior point method for linear programming. [Citation Graph (0, 0)][DBLP ] Math. Program., 1991, v:51, n:, pp:17-43 [Journal ] Donald Goldfarb , Zhiying Jin A new scaling algorithm for the minimum cost network flow problem. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 1999, v:25, n:5, pp:205-211 [Journal ] Donald Goldfarb , Wotao Yin Second-order Cone Programming Methods for Total Variation-Based Image Restoration. [Citation Graph (0, 0)][DBLP ] SIAM J. Scientific Computing, 2005, v:27, n:2, pp:622-645 [Journal ] Wotao Yin , Donald Goldfarb , Stanley Osher A comparison of three total variation based texture extraction models. [Citation Graph (0, 0)][DBLP ] J. Visual Communication and Image Representation, 2007, v:18, n:3, pp:240-252 [Journal ] Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization [Citation Graph (, )][DBLP ] Convergence of fixed point continuation algorithms for matrix rank minimization [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs