Pages that link to "Item:Q1368923"

The following pages link to A combined homotopy interior point method for convex nonlinear programming (Q1368923):

Displayed 23 items.

• Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm (Q257838) ‎ (← links)
• Homotopy interior-point method for a general multiobjective programming problem (Q442940) ‎ (← links)
• Finding a minimal efficient solution of a convex multiobjective program (Q597210) ‎ (← links)
• A homotopy method for getting a local minimum of constrained nonconvex programming (Q838080) ‎ (← links)
• A combined homotopy interior point method for the linear complementarity problem (Q849782) ‎ (← links)
• On the complexity of a combined homotopy interior method for convex programming (Q859861) ‎ (← links)
• Homotopy method for a general multiobjective programming problem (Q937132) ‎ (← links)
• A combined homotopy interior point method for general nonlinear programming problems (Q1354287) ‎ (← links)
• A noninterior path following algorithm for solving a class of multiobjective programming problems (Q1719236) ‎ (← links)
• A continuation method for solving fixed points of self-mappings in general nonconvex sets (Q1863476) ‎ (← links)
• Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition (Q1925395) ‎ (← links)
• Globally convergent method for designing twice spline contractual function (Q2068069) ‎ (← links)
• Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming (Q2228205) ‎ (← links)
• A polynomial path following algorithm for convex programming (Q2479155) ‎ (← links)
• Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set (Q2518117) ‎ (← links)
• A smoothing homotopy method for solving variational inequalities (Q2518571) ‎ (← links)
• A spline smoothing homotopy method for nonconvex nonlinear programming (Q2810089) ‎ (← links)
• A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming (Q4632694) ‎ (← links)
• A continuation method for solving convex programming problems<i>via</i>fischer reformulation (Q4944417) ‎ (← links)
• A constraint shifting homotopy method for general non-linear programming (Q5169444) ‎ (← links)
• Truncated aggregate homotopy method for nonconvex nonlinear programming (Q5746690) ‎ (← links)
• The aggregate constraint homotopy method for nonconvex nonlinear programming (Q5946387) ‎ (← links)
• A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints (Q6182689) ‎ (← links)