On the solution of equality constrained quadratic programming problems arising in optimization

SIAM Journal on Scientific Computing

Volumn 23, Issue 4, 2002, Pages 1376-1395

  Gould, Nicholas I M ^a   Hribar, Mary E ^a   Nocedal, Jorge ^a  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

Author keywords

Conjugate gradient method; Iterative refinement; Nonlinear optimization; Pre conditioning; Quadratic programming

Indexed keywords

COMPUTATIONAL METHODS; ITERATIVE METHODS; LINEAR SYSTEMS; MATRIX ALGEBRA; OPTIMIZATION;

CONSTRAINT GRADIENTS;

QUADRATIC PROGRAMMING;

EID: 0036344992     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827598345667     Document Type: Article

References (47)

1. Solving sparse linear systems with sparse backward errors
2. On the augmented system approach to sparse least-squares problems
3. Pivoting and stability in augmented systems
4. CUTE: Constrained and unconstrained testing environment
5. Some stable methods for calculating inertia and solving symmetric linear equations
6. Linear least squares solutions by Housholder transformations
7. An interior point algorithm for large-scale non-linear programming
8. Linearly constrained optimization and projected preconditioned conjugate gradients
9. The null space problem I: Complexity
10. The null space problem II: Algorithms
11. A primal-dual trust-region algorithm for non-convex nonlinear programming
12. A global convergence theory for general trust-region based algorithms for equality constrained optimization
13. Trust-region interior-point SQP algorithms for a class of nonlinear programming problems
14. The multifrontal solution of indefinite sparse symmetric linear equations
15. Second-order multiplier update calculations for optimal control problems and related large scale nonlinear programs
16. Computing a sparse basis for the null-space
17. Maintaining LU factors of a general sparse matrix
18. Iterative methods for ill-conditioned linear systems from optimization
19. Solving the trust-region subproblem using the Lanczos method
20. Sparse orthogonal schemes for structural optimization using the force method
21. Methods of conjugate gradients for solving linear systems
22. Iterative refinement for linear systems and LAPACK
23. Implicit nullspace iterative methods for constrained least squares problems
24. Constraint preconditioning for indefinite linear systems
25. On the implementation of an algorithm for large-scale equality constrained optimization
26. Indefinitely preconditioned inexact Newton method for large sparse equality constrained nonlinear programming problems
27. Preconditioning reduced matrices
28. A trust region method for nordinear programming based on primal interior-point techniques
29. Substructuring methods for computing the null space of equilibrium matrices
30. The conjugate gradient method in extremal problems
31. The conjugate gradient method and trust regions in large scale optimization
32. Nested dissection for sparse nullspace bases
33. Towards an efficient sparsity exploiting Newton method for minimization
34. On large-scale nonlinear network optimization