Pages that link to "Item:Q859861"

The following pages link to On the complexity of a combined homotopy interior method for convex programming (Q859861):

Displaying 3 items.

• Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm (Q257838) (← links)
• A noninterior path following algorithm for solving a class of multiobjective programming problems (Q1719236) (← links)
• A homotopy method for nonlinear second-order cone programming (Q2256956) (← links)