The following pages link to Large sparse numerical optimization (Q792069):
Displaying 15 items.
- Some efficiently solvable problems over integer partition polytopes (Q476314) (← links)
- Approximating polyhedra with sparse inequalities (Q896289) (← links)
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems (Q1107277) (← links)
- A hierarchical algorithm for making sparse matrices sparser (Q1207308) (← links)
- A chordal preconditioner for large-scale optimization (Q1262220) (← links)
- On the use of dense matrix techniques within sparse simplex (Q1309853) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- An algorithm for solving sparse nonlinear least squares problems (Q1822462) (← links)
- The Null Space Problem I. Complexity (Q3747622) (← links)
- Computing a Sparse Basis for the Null Space (Q3774827) (← links)
- A quadratic programming algorithm for large and sparse problems (Q3978055) (← links)
- Solving Large Sparse Nonlinear Programs Using GRG (Q3993662) (← links)
- On Modified Factorizations for Large-Scale Linearly Constrained Optimization (Q4702321) (← links)
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices (Q4720697) (← links)
- \(\mathcal{N}\)IPM-HLSP: an efficient interior-point method for hierarchical least-squares programs (Q6572715) (← links)
