Person:233995

Available identifiers

zbMath Open goldfarb.donaldDBLP95/6682WikidataQ15806309 ScholiaQ15806309MaRDI QIDQ233995

List of research outcomes

Publication	Date of Publication	Type
ADMM for multiaffine constrained optimization	2020-01-21	Paper
Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions	2019-01-14	Paper
Block BFGS Methods	2018-05-18	Paper
Greedy Approaches to Symmetric Orthogonal Tensor Decomposition	2017-11-06	Paper
Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization	2017-05-30	Paper
Linear Convergence of Stochastic Frank Wolfe Variants	2017-03-21	Paper
Block Coordinate Descent Methods for Semidefinite Programming	2016-04-26	Paper
Stochastic Block BFGS: Squeezing More Curvature out of Data	2016-03-31	Paper
Semi-Stochastic Frank-Wolfe Algorithms with Away-Steps for Block-Coordinate Structure Problems	2016-02-03	Paper
Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors	2015-12-09	Paper
An alternating direction method for total variation denoising	2015-09-04	Paper
Fast first-order methods for composite convex optimization with backtracking	2014-09-04	Paper
Robust Low-Rank Tensor Recovery: Models and Algorithms	2014-08-21	Paper
Efficient algorithms for robust and stable principal component pursuit problems	2014-05-23	Paper
Structured Sparsity via Alternating Direction Methods	2014-04-01	Paper
Fast alternating linearization methods for minimizing the sum of two convex functions	2013-11-11	Paper
Efficient block-coordinate descent algorithms for the group Lasso	2013-08-05	Paper
Accelerated linearized Bregman method	2013-04-08	Paper
Fast Multiple-Splitting Algorithms for Convex Optimization	2012-09-12	Paper
On the convergence of an active-set method for ℓ1minimization	2012-08-27	Paper
An interior-point piecewise linear penalty method for nonlinear programming	2011-06-17	Paper
Fixed point and Bregman iterative methods for matrix rank minimization	2011-06-17	Paper
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation	2011-05-17	Paper
Convergence of fixed-point continuation algorithms for matrix rank minimization	2011-05-11	Paper
Fast First-Order Methods for Stable Principal Component Pursuit	2011-05-11	Paper
Alternating direction augmented Lagrangian methods for semidefinite programming	2011-01-28	Paper
Parametric Maximum Flow Algorithms for Fast Total Variation Minimization	2010-10-19	Paper
A Line Search Multigrid Method for Large-Scale Nonlinear Optimization	2010-09-06	Paper
A Curvilinear Search Method for p-Harmonic Flows on Spheres	2009-10-19	Paper
Numerically stable LDLT factorizations in interior point methods for convex quadratic programming	2008-12-02	Paper
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing	2008-04-01	Paper
The Total Variation Regularized $L^1$ Model for Multiscale Decomposition	2008-03-28	Paper
Variational, Geometric, and Level Set Methods in Computer Vision	2006-10-20	Paper
Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties	2006-06-28	Paper
Second-order Cone Programming Methods for Total Variation-Based Image Restoration	2006-05-30	Paper
An Iterative Regularization Method for Total Variation-Based Image Restoration	2005-10-06	Paper
Product-form Cholesky factorization in interior point methods for second-order cone programming	2005-05-12	Paper
A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming	2004-03-11	Paper
An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem	2002-02-07	Paper
Combinatorial interior point methods for generalized network flow problems	2002-01-01	Paper
A polynomial dual simplex algorithm fot the generalized circulation problem.	2002-01-01	Paper
On parametric semidefinite programming	2001-03-18	Paper
A modified barrier-augmented Lagrangian method for constrained minimization	2000-12-17	Paper
A new scaling algorithm for the minimum cost network flow problem	2000-12-12	Paper
Interior Point Trajectories in Semidefinite Programming	1999-02-22	Paper
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem	1998-08-03	Paper
On strongly polynomial dual simplex algorithms for the maximum flow problem	1998-06-11	Paper
Strongly polynomial dual simplex methods for the maximum flow problem	1998-03-11	Paper
A Faster Combinatorial Algorithm for the Generalized Circulation Problem	1997-10-30	Paper
Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2	1996-05-20	Paper
On the Complexity of a Class of Projective Interior Point Methods	1995-07-31	Paper
https://portal.mardi4nfdi.de/entity/Q4325913	1995-03-13	Paper
On solution-containing ellipsoids in linear programming	1994-10-25	Paper
https://portal.mardi4nfdi.de/entity/Q4308908	1994-10-12	Paper
An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs	1994-03-27	Paper
On the maximum capacity augmentation algorithm for the maximum flow problem	1994-02-22	Paper
A Path-Following Projective Interior Point Method for Linear Programming	1994-01-01	Paper
Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization	1993-08-11	Paper
Steepest-edge simplex algorithms for linear programming	1993-06-29	Paper
Exploiting special structure in a primal-dual path-following algorithm	1993-06-29	Paper
Polynomial-time primal simplex algorithms for the minimum cost network flow problem	1992-09-27	Paper
A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming	1992-09-27	Paper
On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem	1992-06-27	Paper
A primal projective interior point method for linear programming	1992-06-25	Paper
An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming	1991-01-01	Paper
Shortest path algorithms using dynamic breadth‐first search	1991-01-01	Paper
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3348677	1990-01-01	Paper
Anti-stalling pivot rules for the network simplex algorithm	1990-01-01	Paper
Efficient Shortest Path Simplex Algorithms	1990-01-01	Paper
A Self-Correcting Version of Karmarkar’s Algorithm	1989-01-01	Paper
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value	1988-01-01	Paper
A relaxed version of Karmarkar's method	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3746806	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3783442	1986-01-01	Paper
Efficient dual simplex algorithms for the assignment problem	1985-01-01	Paper
Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations	1984-01-01	Paper
A numerically stable dual method for solving strictly convex quadratic programs	1983-09-01	Paper
A numerically stable dual method for solving strictly convex quadratic programs	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3340641	1982-01-01	Paper
Modifications and implementation of the ellipsoid algorithm for linear programming	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3962432	1982-01-01	Paper
Feature Article—The Ellipsoid Method: A Survey	1981-01-01	Paper
Curvilinear path steplength algorithms for minimization which use directions of negative curvature	1980-01-01	Paper
Worst case behavior of the steepest edge simplex method	1979-01-01	Paper
A practicable steepest-edge simplex algorithm	1977-01-01	Paper
On the Bartels—Golub decomposition for linear programming bases	1977-01-01	Paper
Matrix factorizations in optimization of nonlinear functions subject to linear constraints — an addendum	1977-01-01	Paper
Generating conjugate directions without line searches using factorized variable metric updating formulas	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4114709	1976-01-01	Paper
Factorized Variable Metric Methods for Unconstrained Optimization	1976-01-01	Paper
Matrix factorizations in optimization of nonlinear functions subject to linear constraints	1976-01-01	Paper
Modification Methods for Inverting Matrices and Solving Systems of Linear Algebraic Equations	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4770783	1972-01-01	Paper
A Family of Variable-Metric Methods Derived by Variational Means	1970-01-01	Paper
Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints	1969-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5663326	1969-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Donald Goldfarb