Pages that link to "Item:Q2464638"
From MaRDI portal
The following pages link to An infeasible interior-point algorithm with full-Newton step for linear optimization (Q2464638):
Displaying 10 items.
- A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function (Q255679) (← links)
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP (Q279828) (← links)
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
- A predictor-corrector algorithm with multiple corrections for convex quadratic programming (Q453603) (← links)
- A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions (Q627154) (← links)
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO (Q634734) (← links)
- A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function (Q843962) (← links)
- A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY (Q2895762) (← links)
- A new class of infeasible interior-point algorithm for linear complementarity problem (Q5400131) (← links)
- A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term (Q6046863) (← links)
