| Publication | Date of Publication | Type |
|---|
ADMM for multiaffine constrained optimization
Optimization Methods & Software | 2020-01-21 | Paper |
Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions
Optimization Methods & Software | 2019-01-14 | Paper |
Block BFGS methods
SIAM Journal on Optimization | 2018-05-18 | Paper |
Greedy approaches to symmetric orthogonal tensor decomposition
SIAM Journal on Matrix Analysis and Applications | 2017-11-06 | Paper |
Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization
SIAM Journal on Optimization | 2017-05-30 | Paper |
Linear Convergence of Stochastic Frank Wolfe Variants
| 2017-03-21 | Paper |
Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
SIAM Journal on Scientific Computing | 2016-10-28 | Paper |
Block coordinate descent methods for semidefinite programming
International Series in Operations Research & Management Science | 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
SIAM Journal on Matrix Analysis and Applications | 2015-12-09 | Paper |
An alternating direction method for total variation denoising
Optimization Methods & Software | 2015-09-04 | Paper |
Fast first-order methods for composite convex optimization with backtracking
Foundations of Computational Mathematics | 2014-09-04 | Paper |
Robust low-rank tensor recovery: models and algorithms
SIAM Journal on Matrix Analysis and Applications | 2014-08-21 | Paper |
Efficient algorithms for robust and stable principal component pursuit problems
Computational Optimization and Applications | 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
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
Efficient block-coordinate descent algorithms for the group Lasso
Mathematical Programming Computation | 2013-08-05 | Paper |
Accelerated linearized Bregman method
Journal of Scientific Computing | 2013-04-08 | Paper |
Fast multiple-splitting algorithms for convex optimization
SIAM Journal on Optimization | 2012-09-12 | Paper |
On the convergence of an active-set method for \(\ell_1\) minimization
Optimization Methods & Software | 2012-08-27 | Paper |
Fixed point and Bregman iterative methods for matrix rank minimization
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
An interior-point piecewise linear penalty method for nonlinear programming
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
SIAM Journal on Scientific Computing | 2011-05-17 | Paper |
Convergence of fixed-point continuation algorithms for matrix rank minimization
Foundations of Computational Mathematics | 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
Mathematical Programming Computation | 2011-01-28 | Paper |
Parametric maximum flow algorithms for fast total variation minimization
SIAM Journal on Scientific Computing | 2010-10-19 | Paper |
A Line Search Multigrid Method for Large-Scale Nonlinear Optimization
SIAM Journal on Optimization | 2010-09-06 | Paper |
A Curvilinear Search Method for p-Harmonic Flows on Spheres
SIAM Journal on Imaging Sciences | 2009-10-19 | Paper |
Numerically stable LDLT factorizations in interior point methods for convex quadratic programming
IMA Journal of Numerical Analysis | 2008-12-02 | Paper |
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
SIAM Journal on Imaging Sciences | 2008-04-01 | Paper |
The Total Variation Regularized $L^1$ Model for Multiscale Decomposition
Multiscale Modeling & Simulation | 2008-03-28 | Paper |
Variational, Geometric, and Level Set Methods in Computer Vision
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
Mathematical Programming. Series A. Series B | 2006-06-28 | Paper |
Second-order Cone Programming Methods for Total Variation-Based Image Restoration
SIAM Journal on Scientific Computing | 2006-05-30 | Paper |
An Iterative Regularization Method for Total Variation-Based Image Restoration
Multiscale Modeling & Simulation | 2005-10-06 | Paper |
Product-form Cholesky factorization in interior point methods for second-order cone programming
Mathematical Programming. Series A. Series B | 2005-05-12 | Paper |
A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
An \(O(nm)\)-time network simplex algorithm for the shortest path problem
Operations Research | 2002-02-07 | Paper |
A polynomial dual simplex algorithm fot the generalized circulation problem.
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
Combinatorial interior point methods for generalized network flow problems
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
On parametric semidefinite programming
Applied Numerical Mathematics | 2001-03-18 | Paper |
A modified barrier-augmented Lagrangian method for constrained minimization
Computational Optimization and Applications | 2000-12-17 | Paper |
A new scaling algorithm for the minimum cost network flow problem
Operations Research Letters | 2000-12-12 | Paper |
Interior Point Trajectories in Semidefinite Programming
SIAM Journal on Optimization | 1999-02-22 | Paper |
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
Mathematics of Operations Research | 1998-08-03 | Paper |
On strongly polynomial dual simplex algorithms for the maximum flow problem
Mathematical Programming. Series A. Series B | 1998-06-11 | Paper |
Strongly polynomial dual simplex methods for the maximum flow problem
Mathematical Programming. Series A. Series B | 1998-03-11 | Paper |
A Faster Combinatorial Algorithm for the Generalized Circulation Problem
Mathematics of Operations Research | 1997-10-30 | Paper |
Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2
ORSA Journal on Computing | 1996-05-20 | Paper |
On the Complexity of a Class of Projective Interior Point Methods
Mathematics of Operations Research | 1995-07-31 | Paper |
scientific article; zbMATH DE number 733518 (Why is no real title available?)
| 1995-03-13 | Paper |
On solution-containing ellipsoids in linear programming
Journal of Optimization Theory and Applications | 1994-10-25 | Paper |
scientific article; zbMATH DE number 653033 (Why is no real title available?)
| 1994-10-12 | Paper |
An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs
Mathematical Programming. Series A. Series B | 1994-03-27 | Paper |
On the maximum capacity augmentation algorithm for the maximum flow problem
Discrete Applied Mathematics | 1994-02-22 | Paper |
A Path-Following Projective Interior Point Method for Linear Programming
SIAM Journal on Optimization | 1994-01-01 | Paper |
Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization
SIAM Journal on Optimization | 1993-08-11 | Paper |
Steepest-edge simplex algorithms for linear programming
Mathematical Programming. Series A. Series B | 1993-06-29 | Paper |
Exploiting special structure in a primal-dual path-following algorithm
Mathematical Programming. Series A. Series B | 1993-06-29 | Paper |
A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
SIAM Journal on Optimization | 1992-09-27 | Paper |
Polynomial-time primal simplex algorithms for the minimum cost network flow problem
Algorithmica | 1992-09-27 | Paper |
On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
Operations Research Letters | 1992-06-27 | Paper |
A primal projective interior point method for linear programming
Mathematical Programming. Series A. Series B | 1992-06-25 | Paper |
An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
Mathematical Programming. Series A. Series B | 1991-01-01 | Paper |
Shortest path algorithms using dynamic breadth‐first search
Networks | 1991-01-01 | Paper |
A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
Efficient Shortest Path Simplex Algorithms
Operations Research | 1990-01-01 | Paper |
Anti-stalling pivot rules for the network simplex algorithm
Networks | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4199934 (Why is no real title available?)
| 1990-01-01 | Paper |
A Self-Correcting Version of Karmarkar’s Algorithm
SIAM Journal on Numerical Analysis | 1989-01-01 | Paper |
A relaxed version of Karmarkar's method
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
scientific article; zbMATH DE number 3982419 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 4046981 (Why is no real title available?)
| 1986-01-01 | Paper |
Efficient dual simplex algorithms for the assignment problem
Mathematical Programming | 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
Mathematical Programming | 1983-09-01 | Paper |
A numerically stable dual method for solving strictly convex quadratic programs
Mathematical Programming | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3784219 (Why is no real title available?)
| 1982-01-01 | Paper |
Modifications and implementation of the ellipsoid algorithm for linear programming
Mathematical Programming | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3873096 (Why is no real title available?)
| 1982-01-01 | Paper |
Feature Article—The Ellipsoid Method: A Survey
Operations Research | 1981-01-01 | Paper |
Curvilinear path steplength algorithms for minimization which use directions of negative curvature
Mathematical Programming | 1980-01-01 | Paper |
Worst case behavior of the steepest edge simplex method
Discrete Applied Mathematics | 1979-01-01 | Paper |
A practicable steepest-edge simplex algorithm
Mathematical Programming | 1977-01-01 | Paper |
On the Bartels—Golub decomposition for linear programming bases
Mathematical Programming | 1977-01-01 | Paper |
Generating conjugate directions without line searches using factorized variable metric updating formulas
Mathematical Programming | 1977-01-01 | Paper |
Matrix factorizations in optimization of nonlinear functions subject to linear constraints — an addendum
Mathematical Programming | 1977-01-01 | Paper |
Matrix factorizations in optimization of nonlinear functions subject to linear constraints
Mathematical Programming | 1976-01-01 | Paper |
Factorized Variable Metric Methods for Unconstrained Optimization
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3538744 (Why is no real title available?)
| 1976-01-01 | Paper |
scientific article; zbMATH DE number 3446698 (Why is no real title available?)
| 1972-01-01 | Paper |
Modification Methods for Inverting Matrices and Solving Systems of Linear Algebraic Equations
| 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
SIAM Journal on Applied Mathematics | 1969-01-01 | Paper |
scientific article; zbMATH DE number 3395301 (Why is no real title available?)
| 1969-01-01 | Paper |
