Pages that link to "Item:Q858741"

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

Displaying 20 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 strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396) (← links)
• A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity (Q833162) (← links)
• A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization (Q979866) (← links)
• A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization (Q988435) (← links)
• A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
• An ADMM-based SQP method for separably smooth nonconvex optimization (Q2069362) (← links)
• A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← links)
• A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← 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 new superlinearly convergent SQP algorithm for nonlinear minimax problems (Q2468786) (← links)
• A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization (Q2510002) (← links)
• A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization (Q2514657) (← links)
• A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems (Q5881251) (← links)
• A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization (Q6102892) (← links)