Pages that link to "Item:Q1280097"

The following pages link to Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD (Q1280097):

Displaying 7 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 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)
• Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems (Q884390) (← links)
• A new finitely convergent algorithm for systems of nonlinear inequalities (Q1001117) (← links)
• Sequential feasible optimal power flow in power systems (Q1045287) (← links)