The following pages link to (Q4288553):
Displaying 15 items.
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Splitting dense columns in sparse linear systems (Q803727) (← links)
- Computational experience with a primal-dual interior point method for linear programming (Q808184) (← links)
- A barrier method for dynamic Leontief-type linear programs (Q1199511) (← links)
- Interior dual proximal point algorithm for linear programs (Q1333478) (← links)
- Deriving potential functions via a symmetry principle for nonlinear equations (Q1375121) (← links)
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
- A primal-dual regularized interior-point method for convex quadratic programs (Q1762462) (← links)
- Primal-dual methods for linear programming (Q1924065) (← links)
- An adaptively regularized sequential quadratic programming method for equality constrained optimization (Q2244236) (← links)
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods (Q4594173) (← links)
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy (Q5057773) (← links)
- Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement (Q5889340) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
