Determinant Expansions of Signed Matrices and of Certain Jacobians. - J. William Helton; Igor Klep; Raul Gomez (SIAM J. Matrix Anal. Appl., 2009)

Relaxing LMI domination matricially. - J. William Helton; Igor Klep; Scott A. McCullough (CDC, 2010)

NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials. - Kristijan Cafuta; Igor Klep; Janez Povh (Optim. Methods Softw., 2011)

Constrained Polynomial Optimization Problems with Noncommuting Variables. - Kristijan Cafuta; Igor Klep; Janez Povh (SIAM J. Optim., 2012)

Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials. - Sabine Burgdorf; Kristijan Cafuta; Igor Klep; Janez Povh (Comput. Optim. Appl., 2013)

An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares. - Igor Klep; Markus Schweighofer (Math. Oper. Res., 2013)

The tracial moment problem and trace-optimization of polynomials. - Sabine Burgdorf; Kristijan Cafuta; Igor Klep; Janez Povh (Math. Program., 2013)

The matricial relaxation of a linear matrix inequality. - J. William Helton; Igor Klep; Scott A. McCullough (Math. Program., 2013)

Rational sums of hermitian squares of free noncommutative polynomials. - Kristijan Cafuta; Igor Klep; Janez Povh (Ars Math. Contemp., 2015)

Sweeping words and the length of a generic vector subspace of Mn(F). - Igor Klep; Spela Spenko (J. Comb. Theory A, 2016)

Constrained trace-optimization of polynomials in freely noncommuting variables. - Igor Klep; Janez Povh (J. Glob. Optim., 2016)

Regular and positive noncommutative rational functions. - Igor Klep; James Eldred Pascoe; Jurij Volcic (J. Lond. Math. Soc., 2017)

Minimizer Extraction in Polynomial Optimization Is Robust. - Igor Klep; Janez Povh; Jurij Volcic (SIAM J. Optim., 2018)

A Matrix Positivstellensatz with Lifting Polynomials. - Igor Klep; Jiawang Nie (SIAM J. Optim., 2020)

Noncommutative Polynomials Describing Convex Sets. - J. William Helton; Igor Klep; Scott A. McCullough; Jurij Volcic (Found. Comput. Math., 2021)

Sparse noncommutative polynomial optimization. - Igor Klep; Victor Magron; Janez Povh (Math. Program., 2022)

Relaxations and Exact Solutions to Quantum Max Cut via the Algebraic Structure of Swap Operators. - Adam Bene Watts; Anirban Chowdhury; Aidan Epperly; J. William Helton; Igor Klep (Quantum, 2024)

A Random Copositive Matrix Is Completely Positive with Positive Probability. - Igor Klep; Tea Strekelj; Aljaz Zalar (SIAM J. Appl. Algebra Geom., 2024)

Certifying Optimality of Bell Inequality Violations: Noncommutative Polynomial Optimization through Semidefinite Programming and Local Optimization. - Timotej Hrga; Igor Klep; Janez Povh (SIAM J. Optim., 2024)

State polynomials: positivity, optimization and nonlinear Bell inequalities. - Igor Klep; Victor Magron; Jurij Volcic; Jie Wang 037 (Math. Program., 2024)

Matrix extreme points and free extreme points of free spectrahedra. - Aidan Epperly; Eric Evert; J. William Helton; Igor Klep (Optim. Methods Softw., 2024)

Quantitative Quantum Soundness for Bipartite Compiled Bell Games via the Sequential NPA Hierarchy. - Igor Klep; Connor Paddock; Marc-Olivier Renou; Simon Schmidt; Lucas Tendick; Xiangling Xu; Yuming Zhao (CoRR, 2025)