The following pages link to (Q2765150):
Displaying 8 items.
- An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments (Q531641) (← links)
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints (Q812423) (← links)
- A quadratically approximate framework for constrained optimization, global and local convergence (Q943517) (← links)
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity (Q1765848) (← links)
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← 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)
