The following pages link to (Q4702075):
Displaying 7 items.
- An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments (Q531641) (← links)
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints (Q812423) (← links)
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q858741) (← links)
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity (Q1765848) (← links)
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024) (← links)
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization (Q2378276) (← links)
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397) (← links)
