logo
ProjectEnded

Taming non convexity?

The status, timeline and source of this project. A free account opens every field.

Source: EU Funding & Tenders Portal

In many important areas and applications of science one has to solve non convex optimization problems and ideally and ultimately one would like to find the global optimum. However in most cases one is faced with NP-hard problems and therefore in practice one has been often satisfied with only a local optimum obtained with some ad-hoc (local) optimization algorithm. TAMING intends to provide a s

Status
Closed
Sector
Power Generation (CCGT)
Location
France
Updated
22 Jul 2026
Source
EU Funding & Tenders Portal

ConstructChat

Ask ConstructChat about Taming non convexity?

Pick a question to edit it, or write your own.

First answer free · no account

I am a

Project Information FAQ

Project Information

3 Q
The project “Taming non convexity?” is an infrastructure initiative in the Power Generation (CCGT) sector, located in France. Taiyo aggregates data on it from EU Funding & Tenders Portal.

Participants

Not available for this record.

Status

Original status

ended

Taiyo status

Closed

Taiyo last update

2026-07-22

Contact

Not available for this record.

Description

Description

In many important areas and applications of science one has to solve non convex optimization problems and ideally and ultimately one would like to find the global optimum. However in most cases one is faced with NP-hard problems and therefore in practice one has been often satisfied with only a local optimum obtained with some ad-hoc (local) optimization algorithm. TAMING intends to provide a systematic methodology for solving hard non convex polynomial optimization problems in all areas of science. Indeed the last decade has witnessed the emergence of Polynomial Optimization as a new field in which powerful positivity certificates from real algebraic geometry have permitted to develop an original and systematic approach to solve (at global optimality) optimization problems with polynomial (and even semi-algebraic) data. The backbone of this powerful methodology is the « moment-SOS » approach also known as « Lasserre hierarchy » which has attracted a lot of attention in many areas (e.g., optimization, applied mathematics, quantum computing, engineering, theoretical computer science) with important potential applications. It is now a basic tool for analyzing hardness of approximation in combinatorial optimization and the best candidate algorithm to prove/disprove the famous Unique Games Conjecture. Recently it has also become a promising new method for solving the important Optimal Power Flow Problem in the strategic domain of Energy Networks (as the only method that could solve to optimality certain types of such problems). However in its present form this promising methodology inherits a high computational cost and a (too) severe problem size limitation which precludes from its application many important real life problems of significant size. Proving that indeed this methodology can fulfill its promises and solve important practical problems in various areas poses major theoretical & practical challenges.

Location

Country

France

Source

Source

EU Funding & Tenders Portal

URL

More Details

Record type

Project

Sector

Power Generation (CCGT)

Article published date

2026-01-01

More on this project

Research

Free account

View all details

You are reading the public part. A free account opens the rest:

  • Every detail on this project
  • News and media coverage
  • Technical research
View all details

Free account · no card · lands you back on this project