On Modified Factorizations for Large-Scale Linearly Constrained Optimization
From MaRDI portal
Recommendations
Cited in
(11)- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems
- Threshold incomplete factorization constraint preconditioners for saddle-point matrices
- Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation
- Inertia-controlling factorizations for optimization algorithms
- An iterative working-set method for large-scale nonconvex quadratic programming
- Sparse block factorization of saddle point matrices
- scientific article; zbMATH DE number 741108 (Why is no real title available?)
- A shifted primal-dual penalty-barrier method for nonlinear optimization
- Sparse Matrix Methods in Optimization
- Newton Methods for Large-Scale Linear Equality-Constrained Minimization
- A Dimensional Reduction Algorithm and Software for Acyclically Dependent Constraints
This page was built for publication: On Modified Factorizations for Large-Scale Linearly Constrained Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702321)