Pages that link to "Item:Q687081"

The following pages link to Exterior point algorithms for nearest points and convex quadratic programs (Q687081):

Displaying 12 items.

• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming (Q706949) (← links)
• A new penalty function algorithm for convex quadratic programming (Q1278947) (← links)
• A vertex algorithm for collision detection (Q1579473) (← links)
• An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
• Projection onto simplicial cones by a semi-smooth Newton method (Q2341098) (← links)
• Projection onto simplicial cones by Picard's method (Q2348931) (← links)
• Improving a primal–dual simplex-type algorithm using interior point methods (Q4646555) (← links)
• Error bounds for solutions of linear equations and inequalities (Q4837939) (← links)
• On using exterior penalty approaches for solving linear programming problems (Q5945315) (← links)
• A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming (Q5965342) (← links)
• On second-order conic programming duals for robust convex quadratic optimization problems (Q6160375) (← links)