Pages that link to "Item:Q1338556"

The following pages link to Norm-relaxed method of feasible directions for solving nonlinear programming problems (Q1338556):

Displaying 28 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 quadratically approximate framework for constrained optimization, global and local convergence (Q943517) (← links)
• A new norm-relaxed SQP algorithm with global convergence (Q972949) (← links)
• Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
• Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD (Q1280097) (← links)
• A generalization of the norm-relaxed method of feasible directions (Q1294211) (← links)
• Convergence analysis of norm-relaxed method of feasible directions (Q1359453) (← links)
• Self-tuning norm-relaxed method of feasible directions (Q1367804) (← links)
• A feasible interior-point algorithm for nonconvex nonlinear programming (Q1774879) (← links)
• Probabilistic version of the method of feasible directions. (Q1855739) (← links)
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
• A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← 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)
• Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
• A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems (Q2435607) (← 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)
• A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139) (← links)
• An active set sequential quadratic programming algorithm for nonlinear optimisation (Q5482578) (← links)
• A superlinearly convergent method of feasible directions. (Q5931665) (← links)