Pages that link to "Item:Q2674577"
From MaRDI portal
The following pages link to An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (Q2674577):
Displaying 6 items.
- A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- A primal-dual infeasible interior point algorithm for a convex quadratic programming problem with box constraints (Q2756554) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (Q3176174) (← links)
- (Q3348711) (← links)
- Constrained LQR Design Using Interior-Point Arc-Search Method for Convex Quadratic Programming with Box Constraints (Q6241205) (← links)