Pages that link to "Item:Q3211107"
From MaRDI portal
The following pages link to A Centered Projective Algorithm for Linear Programming (Q3211107):
Displaying 8 items.
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem (Q2367917) (← links)
- Interior-point solver for large-scale quadratic programming problems with bound constraints (Q2370027) (← links)
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
- Convergence analysis of an inexact potential reduction method for convex quadratic programming (Q2483035) (← links)
- On the probabilistic complexity of finding an approximate solution for linear programming (Q2483208) (← links)
- On the behavior of the homogeneous self-dual model for conic convex optimization (Q2492677) (← links)
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study (Q2643619) (← links)
- On semimonotone star matrices and linear complementarity problem (Q5072466) (← links)
