Pages that link to "Item:Q2147941"
From MaRDI portal
The following pages link to A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941):
Displaying 5 items.
- A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
- An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (Q2674577) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (Q3176174) (← links)
- (Q3348711) (← links)
- A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777) (← links)