Pages that link to "Item:Q1653277"
From MaRDI portal
The following pages link to An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277):
Displaying 13 items.
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem (Q1633334) (← links)
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949) (← links)
- Novel design of morlet wavelet neural network for solving second order Lane-Emden equation (Q1997997) (← 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)
- A primal-dual interior-point algorithm with arc-search for semidefinite programming (Q2311204) (← links)
- A corrector-predictor arc search interior-point algorithm for symmetric optimization (Q2313142) (← links)
- An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems (Q2399607) (← 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)
- A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem (Q6492455) (← links)
