A sparse proximal implementation of the LP dual active set algorithm
- 18 August 2006
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 112 (2), 275-301
- https://doi.org/10.1007/s10107-006-0017-0
Abstract
No abstract availableThis publication has 30 references indexed in Scilit:
- Algorithm 849ACM Transactions on Mathematical Software, 2005
- Row Modifications of a Sparse Cholesky FactorizationSIAM Journal on Matrix Analysis and Applications, 2005
- Algorithm 836ACM Transactions on Mathematical Software, 2004
- A column approximate minimum degree ordering algorithmACM Transactions on Mathematical Software, 2004
- Primal-Dual Strategy for State-Constrained Optimal Control ProblemsComputational Optimization and Applications, 2002
- Multiple-Rank Modifications of a Sparse Cholesky FactorizationSIAM Journal on Matrix Analysis and Applications, 2001
- Modifying a Sparse Cholesky FactorizationSIAM Journal on Matrix Analysis and Applications, 1999
- Commentary—Progress in Linear ProgrammingINFORMS Journal on Computing, 1994
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equationsBIT Numerical Mathematics, 1979
- Generalized gradients and applicationsTransactions of the American Mathematical Society, 1975