Pages that link to "Item:Q1294211"

The following pages link to A generalization of the norm-relaxed method of feasible directions (Q1294211):

Displaying 19 items.

• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
• A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems (Q505808) (← links)
• A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization (Q635233) (← links)
• A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity (Q833162) (← links)
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q858741) (← links)
• A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints (Q861188) (← links)
• A new norm-relaxed SQP algorithm with global convergence (Q972949) (← links)
• A new SQP method of feasible directions for nonlinear programming. (Q1415268) (← links)
• An efficient sequential quadratic programming algorithm for nonlinear programming (Q1765487) (← links)
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
• New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024) (← links)
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints (Q2372939) (← links)
• A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization (Q2378276) (← links)
• A variant of SQP method for inequality constrained optimization and its global convergence (Q2432728) (← links)
• A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming (Q2462105) (← links)
• A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
• A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q2572648) (← links)
• An active set sequential quadratic programming algorithm for nonlinear optimisation (Q5482578) (← links)
• A superlinearly convergent method of feasible directions. (Q5931665) (← links)