Work

Sparse noncommutative polynomial optimization

Year: 2021

Type: article

Source: Mathematical Programming

DOI: 10.1007/s10107-020-01610-1

Authors: Igor Klep, Victor Magron, Janez Povh

Institutions: University of Ljubljana, Centre National de la Recherche Scientifique, Laboratoire d'Analyse et d'Architecture des Systèmes, Institut de Mathématiques de Toulouse

Language: English

Topic: Advanced Optimization Algorithms Research

Subfield: Numerical Analysis

Field: Mathematics

Domain: Physical Sciences

Open Access status: bronze

Funders: Royal Society, Royal Society Te Apārangi, Agence Nationale de la Recherche, Javna Agencija za Raziskovalno Dejavnost RS, Fondation Mathématique Jacques Hadamard, Marsden Fund

Awards: High-Performance Solver for Binary Quadratic Problems, ZLIVANJE BIOMEDICINSKIH PODATKOV Z UPORABO NENEGATIVNE MATRIČNETRI-FAKTORIZACIJE (Slovene), G4656594441, G5947048585, Extending first and second order algorithms for nested classes of optimization problems to solve computationally challenging industrial questions, Algebra, operator theory and financial mathematics, Matrix convex sets and real algebraic geometry, Pozitivne preslikave in realna algebrična geometrija (Slovene), Engineering design, G7679271029, Centre International de Mathématiques et d'Informatique (de Toulouse), Certified OPtimization for cyber-physical Systems verification

OpenAlex ID: W2971613073

FWCI: 5.571

Cites: 69

Cited by: 35

Related to: 20