Pages that link to "Item:Q976392"
From MaRDI portal
The following pages link to Global convergence of a robust filter SQP algorithm (Q976392):
Displaying 14 items.
- An optimization method to estimate models with store-level data: a case study (Q439441) (← links)
- Sequential quadratic programming with a flexible step acceptance strategy (Q693514) (← links)
- Global convergence of a tri-dimensional filter SQP algorithm based on the line search method (Q999072) (← links)
- Extracting clusters from aggregate panel data: a market segmentation study (Q1734765) (← links)
- Optimal maximally decimated m-channel mirrored paraunitary linear phase FIR filter bank design via norm relaxed sequential quadratic programming (Q1983745) (← links)
- Improved filter-SQP algorithm with active set for constrained minimax problems (Q2336309) (← links)
- An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization (Q2342895) (← links)
- Global convergence of a general filter algorithm based on an efficiency condition of the step (Q2453360) (← links)
- A feasible filter SQP algorithm with global and local convergence (Q2511102) (← links)
- A global convergent line search filter SQP method (Q2917911) (← links)
- An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization (Q2926081) (← links)
- A Multidimensional Filter SQP Algorithm for Nonlinear Programming (Q3385680) (← links)
- On sequential approximate simultaneous analysis and design in classical topology optimization (Q5273351) (← links)
- A modified filter SQP method as a tool for optimal control of nonlinear systems with spatio-temporal dynamics (Q5403366) (← links)
