Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
From MaRDI portal
Publication:4504784
DOI10.1080/10556789908805754zbMath0957.90101MaRDI QIDQ4504784
Publication date: 14 September 2000
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789908805754
linear programming; convex quadratic programming; primal-dual interior point algorithm; multiple centrality correctors; primal-dual regularization; symmetric quasidefinite systems
Related Items
Exploiting separability in large-scale linear support vector machine training, Existence, uniqueness, and convergence of the regularized primal-dual central path, Interior point method for long-term generation scheduling of large-scale hydrothermal systems, Exploiting structure in parallel implementation of interior point methods for optimization, Application of lower bound direct method to engineering structures, Some iterative methods for the solution of a symmetric indefinite KKT system, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, Inner solvers for interior point methods for large scale nonlinear programming, Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods, Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems, Preconditioning indefinite systems in interior point methods for large scale linear optimisation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the augmented system approach to sparse least-squares problems
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- Cost-effective sulphur emission reduction under uncertainty
- Interior proximal point algorithm for linear programs
- Solving symmetric indefinite systems in an interior-point method for linear programming
- QHOPDM -- a higher order primal-dual method for large scale convex quadratic programming
- Symmetric indefinite systems for interior point methods
- Implementing cholesky factorization for interior point methods of linear programming
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
- LOQO:an interior point code for quadratic programming
- A repository of convex quadratic programming problems
- Solving Sparse Linear Systems with Sparse Backward Error
- Symmetric Quasidefinite Matrices
