Search Results for author: T. S. Pham

Found 1 papers, 1 papers with code

Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems

3 code implementations6 Jun 2015 V. Jeyakumar, J. B. Lasserre, G. Li, T. S. Pham

Our scheme for problems with a convex lower-level problem involves solving a transformed equivalent single-level problem by a sequence of SDP relaxations; whereas our approach for general problems involving a non-convex polynomial lower-level problem solves a sequence of approximation problems via another sequence of SDP relaxations.

Optimization and Control

Cannot find the paper you are looking for? You can Submit a new open access paper.