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 8 items.

• Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm (Q257838) (← links)
• A combined homotopy interior point method for general nonlinear programming problems (Q1354287) (← links)
• A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← 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)
• A polynomial path following algorithm for convex programming (Q2479155) (← links)
• Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones (Q4559409) (← links)
• A constraint shifting homotopy method for general non-linear programming (Q5169444) (← links)