Pages that link to "Item:Q2266975"
From MaRDI portal
The following pages link to A feasible SQP method for nonlinear programming (Q2266975):
Displaying 17 items.
- Feedback stabilization methods for the solution of nonlinear programming problems (Q398644) (← links)
- Line search SQP method with a flexible step acceptance procedure (Q491490) (← links)
- A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems (Q499683) (← links)
- An SQP method for general nonlinear programs using only equality constrained subproblems (Q1290629) (← links)
- A new SQP method of feasible directions for nonlinear programming. (Q1415268) (← links)
- Stochastic approach for the solution of multi-pantograph differential equation arising in cell-growth model (Q1643314) (← links)
- An efficient sequential quadratic programming algorithm for nonlinear programming (Q1765487) (← links)
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems (Q2257747) (← links)
- A feasible filter SQP algorithm with global and local convergence (Q2511102) (← links)
- A computationally efficient feasible sequential quadratic programming algorithm (Q2719243) (← links)
- Infeasibility Detection and SQP Methods for Nonlinear Optimization (Q3083287) (← links)
- The use of an SQP algorithm in slope stability analysis (Q3159440) (← links)
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization (Q3506289) (← links)
- (Q3812056) (← links)
- A sub‐feasible correction step for non‐linear programming methods with equality constraints (Q4582490) (← links)
- Inequality-Equality Constrained Optimization: An Analytical Robustness Comparison of a Feasibility Method Versus L1 Sequential Quadratic Programming (Q4709752) (← links)
- A practical update criterion for SQP method (Q5758221) (← links)
