Pages that link to "Item:Q4764308"
From MaRDI portal
The following pages link to Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming (Q4764308):
Displaying 7 items.
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
- An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784) (← links)
- Starting-point strategies for an infeasible potential reduction method (Q845561) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
- A still simpler way of introducing interior-point method for linear programming (Q2374256) (← links)
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods (Q2379689) (← links)
- Convergence analysis of an inexact potential reduction method for convex quadratic programming (Q2483035) (← links)