Pages that link to "Item:Q2485397"
From MaRDI portal
The following pages link to An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397):
Displaying 14 items.
- A generalized neural network for solving a class of minimax optimization problems with linear constraints (Q433302) (← links)
- An improved infeasible SSLE method for constrained optimization without strict complementarity (Q502475) (← links)
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization (Q627582) (← links)
- A modified SQP algorithm for minimax problems (Q837129) (← links)
- A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization (Q988435) (← links)
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity (Q1765848) (← links)
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints (Q2372939) (← 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)
- (Q3650828) (← links)
- A sequential quadratic programming algorithm for nonlinear minimax problems (Q5301244) (← links)
- Generalised monotone line search algorithm for degenerate nonlinear minimax problems (Q5485718) (← links)
- The combination stretching function technique with simulated annealing algorithm for global optimization (Q5746719) (← links)
