Pages that link to "Item:Q1002202"

The following pages link to A globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202):

Displaying 12 items.

• A globally convergent non-interior point algorithm with full Newton step for second-order cone programming (Q993313) (← links)
• Failure of global convergence for a class of interior point methods for nonlinear programming (Q1587941) (← links)
• Local convergence of the affine-scaling interior-point algorithm for nonlinear programming (Q1588839) (← links)
• A feasible interior-point algorithm for nonconvex nonlinear programming (Q1774879) (← links)
• Global convergence enhancement of classical linesearch interior point methods for MCPs (Q1861321) (← links)
• A polynomial path following algorithm for convex programming (Q2479155) (← links)
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
• A globally convergent non-interior point homotopy method for solving variational inequalities (Q3096888) (← links)
• A globally convergent version of a general recursive algorithm for nonlinear programming (Q3741433) (← links)
• (Q4388292) (← links)
• A globally convergent regularized interior point method for constrained optimization (Q5058383) (← links)
• A constraint shifting homotopy method for general non-linear programming (Q5169444) (← links)