Pages that link to "Item:Q2572648"

The following pages link to A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q2572648):

Displaying 17 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 new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization (Q627582) (← 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 feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization (Q988435) (← links)
• Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
• A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization (Q2378276) (← links)
• Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
• Primal-dual interior point QP-free algorithm for nonlinear constrained optimization (Q2407660) (← links)
• A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization (Q2460608) (← links)
• A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming (Q2462105) (← links)
• A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139) (← links)
• Generalized monotone line search SQP algorithm for constrained minimax problems (Q3622010) (← links)