The following pages link to Donald Goldfarb (Q233995):
Displayed 50 items.
- A numerically stable dual method for solving strictly convex quadratic programs (Q59165) (← links)
- Fast alternating linearization methods for minimizing the sum of two convex functions (Q378095) (← links)
- Fast first-order methods for composite convex optimization with backtracking (Q404292) (← links)
- Convergence of fixed-point continuation algorithms for matrix rank minimization (Q535287) (← links)
- An interior-point piecewise linear penalty method for nonlinear programming (Q543401) (← links)
- Fixed point and Bregman iterative methods for matrix rank minimization (Q543413) (← links)
- Alternating direction augmented Lagrangian methods for semidefinite programming (Q621749) (← links)
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value (Q1103522) (← links)
- A relaxed version of Karmarkar's method (Q1108926) (← links)
- Worst case behavior of the steepest edge simplex method (Q1134626) (← links)
- A primal projective interior point method for linear programming (Q1176804) (← links)
- On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem (Q1180817) (← links)
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
- (Q1294551) (redirect page) (← links)
- On parametric semidefinite programming (Q1294552) (← links)
- A modified barrier-augmented Lagrangian method for constrained minimization (Q1303780) (← links)
- On the maximum capacity augmentation algorithm for the maximum flow problem (Q1314319) (← links)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← links)
- On solution-containing ellipsoids in linear programming (Q1321453) (← links)
- On strongly polynomial dual simplex algorithms for the maximum flow problem (Q1373745) (← links)
- Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934) (← links)
- Combinatorial interior point methods for generalized network flow problems (Q1396212) (← links)
- A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming (Q1424285) (← links)
- Product-form Cholesky factorization in interior point methods for second-order cone programming (Q1777219) (← links)
- Steepest-edge simplex algorithms for linear programming (Q1802952) (← links)
- Exploiting special structure in a primal-dual path-following algorithm (Q1803615) (← links)
- Accelerated linearized Bregman method (Q1945379) (← links)
- A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)
- Efficient block-coordinate descent algorithms for the group Lasso (Q2392933) (← links)
- Efficient algorithms for robust and stable principal component pursuit problems (Q2450901) (← links)
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem (Q2770116) (← links)
- Block Coordinate Descent Methods for Semidefinite Programming (Q2802537) (← links)
- Robust Low-Rank Tensor Recovery: Models and Algorithms (Q2877087) (← links)
- On the convergence of an active-set method for ℓ<sub>1</sub>minimization (Q2905351) (← links)
- Fast Multiple-Splitting Algorithms for Convex Optimization (Q2910883) (← links)
- An alternating direction method for total variation denoising (Q2943837) (← links)
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation (Q2998011) (← links)
- Parametric Maximum Flow Algorithms for Fast Total Variation Minimization (Q3162127) (← links)
- A Curvilinear Search Method for <i>p</i>-Harmonic Flows on Spheres (Q3183382) (← links)
- Modification Methods for Inverting Matrices and Solving Systems of Linear Algebraic Equations (Q3214078) (← links)
- Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations (Q3217555) (← links)
- (Q3340641) (← links)
- (Q3348677) (← links)
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors (Q3456878) (← links)
- Anti-stalling pivot rules for the network simplex algorithm (Q3470267) (← links)
- Numerically stable LDLT factorizations in interior point methods for convex quadratic programming (Q3543422) (← links)
- A Line Search Multigrid Method for Large-Scale Nonlinear Optimization (Q3586145) (← links)