Pages that link to "Item:Q2483035"
From MaRDI portal
The following pages link to Convergence analysis of an inexact potential reduction method for convex quadratic programming (Q2483035):
Displaying 13 items.
- Interior point methods 25 years later (Q439546) (← links)
- Starting-point strategies for an infeasible potential reduction method (Q845561) (← links)
- Block preconditioners for linear systems in interior point methods for convex constrained optimization (Q2084581) (← links)
- Semi-supervised generalized eigenvalues classification (Q2329903) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods (Q2379689) (← links)
- On the update of constraint preconditioners for regularized KKT systems (Q2397820) (← links)
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study (Q2643619) (← links)
- Convergence analysis of an inexact feasible interior point method for convex quadratic programming (Q2866195) (← links)
- Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections (Q2947227) (← links)
- Sparse Approximations with Interior Point Methods (Q5044994) (← links)
- A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods (Q6039242) (← links)
- Inexact log-domain interior-point methods for quadratic programming (Q6642787) (← links)
