Pages that link to "Item:Q3491323"

The following pages link to An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence (Q3491323):

Displaying 36 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)
• An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
• Convergence behavior of interior-point algorithms (Q689124) (← 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 globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202) (← links)
• Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
• On some efficient interior point methods for nonlinear convex programming (Q1174840) (← links)
• Global linear convergence of a path-following algorithm for some monotone variational inequality problems (Q1321256) (← links)
• A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
• Rank-one techniques in log-barrier function methods for linear programming (Q1333365) (← links)
• Global convergence in infeasible-interior-point algorithms (Q1334952) (← 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)
• An extension of predictor-corrector algorithm to a class of convex separable program (Q1375337) (← links)
• A noninterior path following algorithm for solving a class of multiobjective programming problems (Q1719236) (← links)
• On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461) (← links)
• Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
• Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
• Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition (Q1925395) (← links)
• An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
• Optimum dimensional synthesis of planar mechanisms with geometric constraints (Q2121228) (← links)
• A polynomial path following algorithm for convex programming (Q2479155) (← links)
• A polynomial-time descent method for separable convex optimization problems with linear constraints (Q2802141) (← links)
• A spline smoothing homotopy method for nonconvex nonlinear programming (Q2810089) (← links)
• A decomposition algorithm for nested resource allocation problems (Q2810553) (← links)
• Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints (Q3177632) (← links)
• A path following algorithm for a class of convex programming problems (Q4016864) (← links)
• A generalized interior-point barrier function approach for smooth convex programming with linear constraints (Q4264497) (← links)
• Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem (Q4266399) (← links)
• A quadratically convergent scaling newton’s method for nonlinear complementarity problems (Q4836762) (← links)
• A quadratically convergent scaling newton’s method for nonlinear programming problems (Q4944414) (← links)
• AN ENTROPY CONTINUATION METHOD FOR A CLASS OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS (Q5035348) (← links)
• The aggregate constraint homotopy method for nonconvex nonlinear programming (Q5946387) (← links)