Further Developments in the Global Resolution of Convex Programs with Complementarity Constraints
Abstract
The main objective of this research is investigation of designing effective algorithms for computing globally optimal solutions to convex programs with complementarity constraints (CPCCs) and some special subclasses. These are nonconvex optimization problems with convex objective functions and constraints, together with complementarity restrictions on certain pairs of the variables.
Document Details
- Document Type
- DoD Grant Award
- Publication Date
- Mar 23, 2016
- Source ID
- FA95501510126
Entities
People
- Jong-shi Pang
Organizations
- Air Force Office of Scientific Research
- United States Air Force
- University of Southern California