On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
From MaRDI portal
Publication:2457946
DOI10.1007/s10589-007-9035-yzbMath1171.90548DBLPjournals/coap/CafieriDSS07OpenAlexW2059226463WikidataQ58832853 ScholiaQ58832853MaRDI QIDQ2457946
Sonia Cafieri, Valentina De Simone, Daniela di Serafino, Marco D'apuzzo
Publication date: 24 October 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9035-y
Related Items (14)
Sparse Approximations with Interior Point Methods ⋮ Starting-point strategies for an infeasible potential reduction method ⋮ On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods ⋮ Using constraint preconditioners with regularized saddle-point problems ⋮ Stopping criteria for inner iterations in inexact potential reduction methods: a computational study ⋮ On the update of constraint preconditioners for regularized KKT systems ⋮ Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections ⋮ Stability and accuracy of inexact interior point methods for convex quadratic programming ⋮ Two block triangular preconditioners for asymmetric saddle point problems ⋮ A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems ⋮ A shift-splitting preconditioner for asymmetric saddle point problems ⋮ An inexact interior-point method for system analysis ⋮ Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics ⋮ Block preconditioners for linear systems in interior point methods for convex constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Computational results of an interior point algorithm for large scale linear programming
- An interior point method for quadratic programs based on conjugate projected gradients
- A computational study of the homogeneous algorithm for large-scale convex optimization
- Potential-reduction methods in mathematical programming
- A QMR-based interior-point algorithm for solving linear programs
- Topics in semidefinite and interior-point methods
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- Parallel interior-point method for linear and quadratic programs with special structure
- Preconditioning indefinite systems in interior point methods for optimization
- Interior-point solver for large-scale quadratic programming problems with bound constraints
- On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Stability of Augmented System Factorizations in Interior-Point Methods
- Preconditioning of Indefinite Problems by Regularization
- A Centered Projective Algorithm for Linear Programming
- Interior‐point method for non‐linear non‐convex optimization
- Numerical solution of saddle point problems
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Preconditioners for Indefinite Systems Arising in Optimization
- Path-Following Methods for Linear Programming
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods
- Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- An Iteration for Indefinite Systems and Its Application to the Navier--Stokes Equations
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Constraint Preconditioning for Indefinite Linear Systems
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Symmetric Quasidefinite Matrices
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations
- Preconditioning Mixed Finite Element Saddle-point Elliptic Problems
- Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization
- Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
- Object-oriented software for quadratic programming
- CUTEr and SifDec
- Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
This page was built for publication: On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
