An inexact interior-point method for system analysis
From MaRDI portal
Recommendations
- Convergence analysis of an inexact infeasible interior point method for semidefinite programming
- Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
- A primal-dual infeasible interior point algorithm for semidefinite programming
- Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results
Cites work
- A Class of Nonsymmetric Preconditioners for Saddle Point Problems
- A Preconditioner for Generalized Saddle Point Problems
- A primal-dual interior-point method for robust optimal control of linear discrete-time systems
- Affine parameter-dependent Lyapunov functions and real parametric uncertainty
- An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps
- Constraint Preconditioning for Indefinite Linear Systems
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 1953446 (Why is no real title available?)
- scientific article; zbMATH DE number 951459 (Why is no real title available?)
- Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems
- Improved stability analysis and gain-scheduled controller synthesis for parameter-dependent systems
- Iterative Solution of Augmented Systems Arising in Interior Methods
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Numerical solution of saddle point problems
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
- On the Nesterov--Todd Direction in Semidefinite Programming
- Preconditioners for Indefinite Systems Arising in Optimization
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- Preconditioning indefinite systems in interior point methods for optimization
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Some iterative methods for the solution of a symmetric indefinite KKT system
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
Cited in
(2)
This page was built for publication: An inexact interior-point method for system analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578795)
