Pages that link to "Item:Q4016864"

The following pages link to A path following algorithm for a class of convex programming problems (Q4016864):

Displaying 26 items.

• Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm (Q257838) (← links)
• Interior-point Lagrangian decomposition method for separable convex optimization (Q846931) (← links)
• On the complexity of a combined homotopy interior method for convex programming (Q859861) (← links)
• Long-step primal path-following algorithm for monotone variational inequality problems (Q1275718) (← links)
• Controlled dual perturbations for central path trajectories in geometric programming (Q1328646) (← links)
• A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
• A combined homotopy interior point method for general nonlinear programming problems (Q1354287) (← links)
• Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← 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)
• Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems. (Q1807690) (← links)
• On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461) (← links)
• The curvature integral and the complexity of linear complementarity problems (Q1904662) (← links)
• An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
• Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions (Q2412702) (← links)
• A polynomial path following algorithm for convex programming (Q2479155) (← links)
• A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^* (Q2709447) (← links)
• A spline smoothing homotopy method for nonconvex nonlinear programming (Q2810089) (← links)
• Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints (Q3177632) (← links)
• Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems (Q4240625) (← links)
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem (Q4266399) (← links)
• Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
• A continuation method for solving convex programming problems<i>via</i>fischer reformulation (Q4944417) (← links)
• AN ENTROPY CONTINUATION METHOD FOR A CLASS OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS (Q5035348) (← links)
• Analysis of some interior point continuous trajectories for convex programming (Q5277955) (← links)
• The aggregate constraint homotopy method for nonconvex nonlinear programming (Q5946387) (← links)