A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
From MaRDI portal
Publication:697548
Recommendations
- A class of quadratic programs with linear complementarity constraints
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
- A new algorithm for solving the general quadratic programming problem
- On convex quadratic programs with linear complementarity constraints
- scientific article; zbMATH DE number 7366738
Cites work
- scientific article; zbMATH DE number 1217655 (Why is no real title available?)
- scientific article; zbMATH DE number 1329057 (Why is no real title available?)
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A global optimization approach for the linear two-level program
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A new extreme point algorithm and its application in PSQP algorithms for solving mathematical programs with linear complementarity constraints.
- A numerical approach to optimization problems with variational inequality constraints
- A simple algorithm for the-linear bilevel programming problem
- A smoothing method for mathematical programs with equilibrium constraints
- Bilevel and multilevel programming: A bibliography review
- Convex two-level optimization
- Derivative evaluation and computational experience with large bilevel mathematical programs
- Descent approaches for quadratic bilevel programming
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
- Heuristic algorithms for delivered price spatially competitive network facility location problems
- Minimization of Locally Lipschitzian Functions
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On bilevel programming. I: General nonlinear cases
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- The Linear-Quadratic Bilevel Programming Problem
Cited in
(13)- On solving difference of convex functions programs with linear complementarity constraints
- Conic approximation to quadratic optimization with linear complementarity constraints
- Globalizing a nonsmooth Newton method via nonmonotone path search
- A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
- A branch-and-bound algorithm for instrumental variable quantile regression
- Optimization problems with equilibrium constraints and their numerical solution.
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming
- Direct pseudo-spectral method for optimal control of obstacle problem-an optimal control problem governed by elliptic variational inequality
- Nonlinear robust optimization via sequential convex bilevel programming
- scientific article; zbMATH DE number 7366738 (Why is no real title available?)
- scientific article; zbMATH DE number 970341 (Why is no real title available?)
- A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
This page was built for publication: A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697548)
