Pages that link to "Item:Q2432613"
From MaRDI portal
The following pages link to A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints (Q2432613):
Displaying 14 items.
- Practical constraint \(K\)-segment principal curve algorithms for generating railway GPS digital map (Q460363) (← links)
- A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints (Q668747) (← links)
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints (Q812423) (← links)
- A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints (Q816061) (← links)
- A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function (Q1721022) (← links)
- A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints (Q2353465) (← links)
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints (Q2369090) (← links)
- Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
- A new method for solving multiobjective bilevel programs (Q2398775) (← links)
- A robust SQP method for mathematical programs with linear complementarity constraints (Q2506190) (← links)
- An SQP method for mathematical programs with complementarity constraints with strong convergence properties. (Q2810178) (← links)
- (Q3002141) (← links)
- Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints (Q3096884) (← links)
- A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization (Q5085236) (← links)
