Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Code and Data Repository for A Heuristic for Complementarity Problems Using Difference of Convex Functions

View through CrossRef
The repository contains the implementation of a heuristic for solving linear and nonlinear complementarity problems (LCPs and NCPs) using a difference of convex functions (DC) approach. The method is referred to as DCA-BL (Difference of Convex Function Algorithms for Bilinear Terms). All algorithms are implemented in Python. LCP problem instances are implemented using the Pyomo modeling language, while NCP instances are implemented using gurobipy. The heuristic is based on the DCA framework, which iteratively solves a sequence of convex approximations to the original non-convex problem.
Title: Code and Data Repository for A Heuristic for Complementarity Problems Using Difference of Convex Functions
Description:
The repository contains the implementation of a heuristic for solving linear and nonlinear complementarity problems (LCPs and NCPs) using a difference of convex functions (DC) approach.
The method is referred to as DCA-BL (Difference of Convex Function Algorithms for Bilinear Terms).
All algorithms are implemented in Python.
LCP problem instances are implemented using the Pyomo modeling language, while NCP instances are implemented using gurobipy.
The heuristic is based on the DCA framework, which iteratively solves a sequence of convex approximations to the original non-convex problem.

Related Results

Ostrowski-Type Fractional Integral Inequalities: A Survey
Ostrowski-Type Fractional Integral Inequalities: A Survey
This paper presents an extensive review of some recent results on fractional Ostrowski-type inequalities associated with a variety of convexities and different kinds of fractional ...
A Heuristic for Complementarity Problems Using Difference of Convex Functions
A Heuristic for Complementarity Problems Using Difference of Convex Functions
We present a new difference of convex functions algorithm (DCA) for solving linear and nonlinear mixed complementarity problems (MCPs). The approach is based on the reformulation o...
Globally Findable Planetary Data: The Interdisciplinary TRR170-DB Repository
Globally Findable Planetary Data: The Interdisciplinary TRR170-DB Repository
Introduction: The TRR170-DB data repository (https://planetary-data-portal.org/) manages the research data from the collaborative research center ‘Late Accretion onto Ter...
Variation-based complementarity assessment between wind and solar resources in China
Variation-based complementarity assessment between wind and solar resources in China
The complementarity between wind and solar resources is considered one of the factors that restrict the utilization of intermittent renewable power sources such as these, but the t...
PRIORITIES AND MECHANISMS FOR BALANCING THE FOREIGN TRADE IN AGRICULTURAL PRODUCTS BASED ON COMPLEMENTARITY
PRIORITIES AND MECHANISMS FOR BALANCING THE FOREIGN TRADE IN AGRICULTURAL PRODUCTS BASED ON COMPLEMENTARITY
The research paper aims at carrying out a systematic analysis of the complementarity of foreign trade in agricultural products and to substantiate on this basis the priorities for ...
Convex hull peeling
Convex hull peeling
Enveloppes convexes pelées Cette thèse porte sur la construction du convex hull peeling (qu’on pourrait traduire littéralement par enveloppe convexe pelée). Le conv...

Back to Top