Methods for Computing and Modifying the LDV Factors of a Matrix
From MaRDI portal
Cited in
(19)- Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems
- An active set RQP algorithm for engineering design optimization
- The simplex method is not always well behaved
- Least squares modifications with inverse factorizations: Parallel implications
- A dual projective simplex method for linear programming
- Pivoting strategy for rank-one modification of \(LDM^ t\)-like factorization
- Analysis and implementation of a dual algorithm for constrained optimization
- Variable metric methods for unconstrained optimization and nonlinear least squares
- Product-form Cholesky factorization in interior point methods for second-order cone programming
- Computational methods for optimum design of large complex systems
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- scientific article; zbMATH DE number 4180681 (Why is no real title available?)
- Sparse matrix factor modification in structural reanalysis
- Large-scale linear programming: Geometry, working bases and factorizations
- Modifications and implementation of the ellipsoid algorithm for linear programming
- An implementation of the simplex method for linear programming problems with variable upper bounds
- Large-scale linearly constrained optimization
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. II. An efficient implementation with linear least squares subproblems
This page was built for publication: Methods for Computing and Modifying the LDV Factors of a Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4107841)
