Hola,
¿eres nuevo aquí?

Regístrate gratis y conecta tu empresa con financiación pública, partners y proyectos.

Tengo cuenta

Regístrate

Ver video

SYMOPTIC

Financiado

Cerrado

Symmetry and Optimization at the Frontiers of Computation

Noncommutative group optimization is a powerful emerging paradigm, which has already led to the solution of outstanding problems in computational complexity, algebra, and statistics. Pioneered by the PI and collaborators, it gener... ver más

30/04/2027

RUHR-UNIVERSITAET...

2M€

Presupuesto del proyecto: 2M€

Líder del proyecto

RUHRUNIVERSITAET BOCHUM No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Fecha límite participación Sin fecha límite de participación.

Financiación concedida El organismo HORIZON EUROPE notifico la concesión del proyecto el día 2022-05-01

ERC-2021-STG: ERC STARTING GRANTS Scope:Objectives

I+D

Cerrada hace 3 años

0% 100%

Información adicional privada

No hay información privada compartida para este proyecto. Habla con el coordinador.

Participantes

RUHR-UNIVERSITAET BOCHUM

Lider

Conecta tu I+D

¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video

Proyectos interesantes

A3 Algebraic Algorithms and Applications 100K€ Cerrado

EPRICOT Efficient Proofs and Computation A Unified Algebraic Appro... 2M€ Cerrado

TCSTURKEY Analysis of Boolean Functions for Algorithms and Complexity 116K€ Cerrado

TIPEA Technology Transfer between Integer Programming and Efficien... 1M€ Cerrado

MTM2013-40455-P METODOS COMPUTACIONALES Y EFECTIVOS EN ALGEBRA, D-MODULOS Y... 90K€ Cerrado

MCC Mapping the Complexity of Counting 2M€ Cerrado

Duración del proyecto: 59 meses Fecha Inicio: 2022-05-01
Fecha Fin: 2027-04-30

Líder del proyecto

RUHRUNIVERSITAET BOCHUM No se ha especificado una descripción o un objeto social para esta compañía.

TRL 4-5

Presupuesto del proyecto 2M€

Fecha límite de participación Sin fecha límite de participación.

Descripción del proyecto Noncommutative group optimization is a powerful emerging paradigm, which has already led to the solution of outstanding problems in computational complexity, algebra, and statistics. Pioneered by the PI and collaborators, it generalizes convex optimization from Euclidean space to the far more general setting of curved spaces with symmetries. Its unfamiliar kind of convexity has recently received much attention in statistics and machine learning. The symmetries are realized by noncommutative groups and imply a high degree of algebraic structure. This combination of symmetry and optimization promises to be key to fast algorithms and deep structural insight. Noncommutative group optimization connects important problems across a wide range of disciplines that appear unrelated at first glance: program testing and derandomization in computer science, estimation problems in statistics, isomorphism problems in algebra, the P vs NP problem and circuit lower bounds in complexity theory, optimal transport in machine learning, marginal and entanglement problems in quantum information, and optimization on quantum computers. This list contains both discrete and continuous problems, theoretical and applied ones, for classical as well as for quantum computers. They have been studied separately over many years by many authors. Here they are brought together in a new innovative way.This project aims to develop the theoretical and algorithmic foundations of noncommutative group optimization and apply it to longstanding theoretical problems and practical applications. This has high potential for long-lasting impact at several frontiers of computation: in addition to contributing a new paradigm and widely-applicable methods to optimization, we aim to give efficient algorithmic solutions to difficult problems in algebra, make progress on the limits of efficient computation, and unlock the potential of quantum computers for optimization.

Conecta tu I+D

Entra hoy

¿Olvidé mi contraseña?

Financiación

Empresas

CTIs/Universidades

Proyectos

Investigadores