Parallel interior-point method for linear and quadratic programs with special structure
From MaRDI portal
Publication:1608140
DOI10.1023/A:1017523228692zbMath1006.90087OpenAlexW2168253786MaRDI QIDQ1608140
C. Durazzi, Gaetano Zanghirati, Valeria Ruggiero
Publication date: 12 August 2002
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1017523228692
Related Items
Unnamed Item, Inner solvers for interior point methods for large scale nonlinear programming, 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, An inexact Newton method combined with Hestenes multipliers' scheme for the solution of Karush-Kuhn-Tucker systems
Uses Software
Cites Work
- Computational experience with a primal-dual interior point method for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- A scalable parallel interior point algorithm for stochastic linear programming and robust optimization
- Inexact interior-point method
- Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints
- Symmetric indefinite systems for interior point methods
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- On the Newton interior-point method for nonlinear programming problems
- A set of staircase linear programming test problems
- Inexact Newton Methods
- On the Implementation of a Primal-Dual Interior Point Method
- On Finding Supernodes for Sparse Matrix Computations
- Globally Convergent Inexact Newton Methods
- Robust Optimization of Large-Scale Systems
- Choosing the Forcing Terms in an Inexact Newton Method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
