Pages that link to "Item:Q2495533"
From MaRDI portal
The following pages link to A polynomial predictor-corrector interior-point algorithm for convex quadratic programming (Q2495533):
Displayed 5 items.
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems (Q979273) (← links)
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier (Q1935397) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function (Q2817226) (← links)
- A new primal-dual interior-point algorithm for convex quadratic optimization (Q5320227) (← links)