Pages that link to "Item:Q1315412"

The following pages link to An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412):

Displaying 9 items.

• On the cooperation of recycling operations (Q2256148) (← links)
• An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
• Scheduling with partial rejection (Q2661510) (← links)
• An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i>^3.5<i>L</i>) Arithmetic Operations (Q3200887) (← links)
• A combination of potential reduction steps and steepest descent steps for solving convex programming problems (Q5317840) (← links)
• (Q5382412) (← links)
• A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems (Q5492637) (← links)
• Log-domain interior-point methods for convex quadratic programming (Q6164958) (← links)