Pages that link to "Item:Q848564"
From MaRDI portal
The following pages link to A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564):
Displaying 6 items.
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity (Q833162) (← links)
- A simple feasible SQP algorithm for inequality constrained optimization (Q858743) (← links)
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization (Q1589812) (← links)
- A variant of SQP method for inequality constrained optimization and its global convergence (Q2432728) (← links)
- A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397) (← links)