Pages that link to "Item:Q1361104"
From MaRDI portal
The following pages link to Potential-reduction methods in mathematical programming (Q1361104):
Displaying 6 items.
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- Tensor complementarity problems. II: Solution methods (Q2275317) (← 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)
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study (Q2643619) (← links)
