Pages that link to "Item:Q1353364"

The following pages link to Interior point techniques in optimization. Complementarity, sensitivity and algorithms (Q1353364):

Displaying 8 items.

• Multimodal image registration by elastic matching of edge sketches via optimal control (Q380597) (← links)
• A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
• On the complexity of a combined homotopy interior method for convex programming (Q859861) (← links)
• Long-step interior-point algorithms for a class of variational inequalities with monotone operators (Q1264995) (← links)
• Polynomial primal-dual cone affine scaling for semidefinite programming (Q1294555) (← links)
• Examples of ill-behaved central paths in convex optimization (Q1777216) (← links)
• LPAKO: A Simplex-based Linear Programming Program (Q4709753) (← links)
• A new primal-dual interior-point algorithm for convex quadratic optimization (Q5320227) (← links)