Pages that link to "Item:Q846474"
From MaRDI portal
The following pages link to A type of efficient feasible SQP algorithms for inequality constrained optimization (Q846474):
Displaying 11 items.
- An efficient feasible SQP algorithm for inequality constrained optimization (Q837710) (← links)
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← 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)
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems (Q2257747) (← links)
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization (Q2475402) (← links)
- An SQP algorithm with equality constrained subproblems for nonlinear inequality constrained optimization (Q2793042) (← links)
- A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139) (← links)
- A feasible trust region SQP method with nonmonotone line search for inequality constrained optimization (Q2886642) (← links)
- (Q3405292) (← links)
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization (Q3506289) (← links)