The following pages link to (Q3002141):
Displaying 7 items.
- An improved infeasible SSLE method for constrained optimization without strict complementarity (Q502475) (← links)
- An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments (Q531641) (← links)
- A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints (Q816061) (← links)
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
- Superlinearly convergent methods for solving a class of implicit complementarity problems based on sign analysis (Q2174792) (← links)
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY (Q3013564) (← links)
- A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions (Q5704107) (← links)
