Pages that link to "Item:Q2378276"

The following pages link to A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization (Q2378276):

Displaying 9 items.

• 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 simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← 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)
• An improved sequential quadratic programming algorithm for solving general nonlinear programming problems (Q2257747) (← links)
• A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization (Q2510002) (← links)
• A superlinearly convergent hybrid algorithm for solving nonlinear programming (Q2628199) (← links)
• A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139) (← links)