Pages that link to "Item:Q816061"
From MaRDI portal
The following pages link to A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints (Q816061):
Displaying 13 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 QP-free algorithm for mathematical programs with equilibrium constraints (Q668747) (← links)
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
- A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function (Q1721022) (← links)
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
- A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
- Superlinearly convergent methods for solving a class of implicit complementarity problems based on sign analysis (Q2174792) (← links)
- A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints (Q2353465) (← links)
- An infeasible nonmonotone SSLE algorithm for nonlinear programming (Q2379186) (← links)
- (Q3002141) (← links)
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY (Q3013564) (← links)
- The improved convergence of MSMMAOR method for linear complementarity problems (Q4965570) (← links)
