Pages that link to "Item:Q1989949"
From MaRDI portal
The following pages link to Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949):
Displaying 10 items.
- A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem (Q1633334) (← links)
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood (Q2048820) (← links)
- A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (Q2050559) (← links)
- An infeasible interior-point arc-search algorithm for nonlinear constrained optimization (Q2066199) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs (Q2173343) (← links)
- On the convergence analysis of arc search interior point methods for LCPs (Q2337791) (← links)
- An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (Q2674577) (← links)
- A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777) (← links)