Inertia-controlling factorizations for optimization algorithms

DOI10.1016/S0168-9274(02)00119-8zbMath1016.65039WikidataQ114121561 ScholiaQ114121561MaRDI QIDQ1862009

Anders Forsgren

Publication date: 10 March 2003

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

optimizationsparse matrix factorizationsymmetric indefinite factorization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Variable parameter Uzawa method for solving a class of block three-by-three saddle point problems, Primal and dual active-set methods for convex quadratic programming, Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy, On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods, Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number, Inner solvers for interior point methods for large scale nonlinear programming, An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization, A comparison of reduced and unreduced KKT systems arising from interior point methods, Spectral estimates for unreduced symmetric KKT systems arising from Interior Point methods, A regularization method for constrained nonlinear least squares, The rank reduction procedure of Egerváry, A study of structure-exploiting SQP algorithms for an optimal control problem with coupled hyperbolic and ordinary differential equation constraints, A stabilized SQP method: superlinear convergence, Equalities and inequalities for inertias of Hermitian matrices with applications, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization, An iterative working-set method for large-scale nonconvex quadratic programming

Uses Software

• Meschach
• CUTEr
• MA27
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factorizing symmetric indefinite matrices
• On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
• Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
• Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and Indefinite
• Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
• Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
• Numerical Optimization
• CUTE
• On Modified Factorizations for Large-Scale Linearly Constrained Optimization
• The Factorization of Sparse Symmetric Indefinite Matrices
• Symmetric Quasidefinite Matrices
• On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
• Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization
• Newton Methods for Large-Scale Linear Equality-Constrained Minimization
• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations