Pages that link to "Item:Q1361104"
From MaRDI portal
The following pages link to Potential-reduction methods in mathematical programming (Q1361104):
Displaying 16 items.
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
- An active-set strategy in an interior point method for linear programming (Q687036) (← links)
- A potential-reduction variant of Renegar's short-step path-following method for linear programming (Q811094) (← links)
- Starting-point strategies for an infeasible potential reduction method (Q845561) (← links)
- A nonconvex weighted potential function for polynomial target following methods (Q1265911) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- Extensions of the potential reduction algorithm for linear programming (Q1336068) (← links)
- Large step volumetric potential reduction algorithms for linear programming (Q1915924) (← links)
- An infeasible-interior-point potential-reduction algorithm for linear programming (Q1961981) (← 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)
- A Short-Cut Potential Reduction Algorithm for Linear Programming (Q4274639) (← links)
- Computational experience with a modified potential reduction algorithm for linear programming (Q5200565) (← links)
- A combination of potential reduction steps and steepest descent steps for solving convex programming problems (Q5317840) (← links)
