A Filter algorithm for solving mathematical programming with linear complementarity constraints
From MaRDI portal
Publication:3405146
Recommendations
- scientific article; zbMATH DE number 6129816
- A trust-region filter-SQP method for mathematical programs with linear complementarity constraints
- A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints
Cited in
(5)- scientific article; zbMATH DE number 5951611 (Why is no real title available?)
- An efficient linear programming solver for optimal filter synthesis
- A trust-region filter-SQP method for mathematical programs with linear complementarity constraints
- scientific article; zbMATH DE number 1998924 (Why is no real title available?)
- scientific article; zbMATH DE number 6129816 (Why is no real title available?)
This page was built for publication: A Filter algorithm for solving mathematical programming with linear complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3405146)