Igor Klep
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Igor Klep has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Jurij Volčič
University of Auckland
22 shared publications - J. William Helton
University of California San Diego
14 shared publications - Scott McCullough
Univ Florida, Dept Math, Gainesville, FL 32611 USA
14 shared publications - Victor Magron
LAAS CNRS
10 shared publications - Janez Povh
Rudolfovo Science and Technology Centre Novo mesto Slovenia
6 shared publications - Matej Brešar
Faculty of Mathematics and Physics, University of Ljubljana, Ljubljana, Slovenia
5 shared publications
Latest Publications
- Open Access
- 7 July 2026
- Published by Springer Nature in Foundations of Computational Mathematics
- p. 1-78
First-Order Optimality Conditions for Non-Commutative Optimization Problems
We consider the problem of optimizing the state average of a polynomial of non-commuting variables, over all states and operators satisfying a number of polynomial constraints, and over all Hilbert spaces where such states and operators are defined. Such non-commutative polynomial optimization (NPO) problems are routinely solved through hierarchies of semidefinite programming (SDP) relaxations. By formulating the general NPO problem in Lagrangian terms, we heuristically derive first-order optimality conditions via small variations in the problem variables. Although the derivation is not rigorous, it gives rise to two types of optimality conditions—state and operator—which are rigorously analyzed in the paper. Both types of conditions can be enforced through additional positive semidefinite constraints in the SDP hierarchies. State optimality conditions are shown to be satisfied by all NPO problems. For NPO problems with optimal solutions (such as, e.g., Archimedean ones) they allow enforcing a new type of constraints: namely, restricting the optimization over states to the set of common ground states of an arbitrary number of operators. Operator optimality conditions are the non-commutative analogs of the Karush–Kuhn–Tucker (KKT) conditions, which are known to hold in many classical optimization problems. In this regard, we prove that a weak form of operator optimality holds for all NPO problems; stronger versions require the problem constraints to satisfy some qualification criterion, just like in the classical case (e.g.: Mangasarian–Fromovitz constraint qualification). We test the power of the new optimality conditions by computing local properties of ground states of many-body spin systems and the maximum quantum violation of Bell inequalities.
- 7 July 2026
- Published by Springer Nature in Foundations of Computational Mathematics
- p. 1-78
Open AccessFirst-Order Optimality Conditions for Non-Commutative Optimization Problems
We consider the problem of optimizing the state average of a polynomial of non-commuting variables, over all states and operators satisfying a number of polynomial constraints, and over all Hilbert spaces where such states and operators are defined. Such non-commutative polynomial optimization (NPO) problems are routinely solved through hierarchies of semidefinite programming (SDP) relaxations. By formulating the general NPO problem in Lagrangian terms, we heuristically derive first-order optimality conditions via small variations in the problem variables. Although the derivation is not rigorous, it gives rise to two types of optimality conditions—state and operator—which are rigorously analyzed in the paper. Both types of conditions can be enforced through additional positive semidefinite constraints in the SDP hierarchies. State optimality conditions are shown to be satisfied by all NPO problems. For NPO problems with optimal solutions (such as, e.g., Archimedean ones) they allow enforcing a new type of constraints: namely, restricting the optimization over states to the set of common ground states of an arbitrary number of operators. Operator optimality conditions are the non-commutative analogs of the Karush–Kuhn–Tucker (KKT) conditions, which are known to hold in many classical optimization problems. In this regard, we prove that a weak form of operator optimality holds for all NPO problems; stronger versions require the problem constraints to satisfy some qualification criterion, just like in the classical case (e.g.: Mangasarian–Fromovitz constraint qualification). We test the power of the new optimality conditions by computing local properties of ground states of many-body spin systems and the maximum quantum violation of Bell inequalities.
- 1 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 51 (2) , 1037-1060
Positivstellensätze and Moment Problems with Universal Quantifiers
This paper studies Positivstellensätze and moment problems for sets K that are given by universal quantifiers. Let Q be the closed set of universal quantifiers. Fix a finite nonnegative Borel measure whose support is Q and assume it satisfies the multivariate Carleman condition. First, we prove a Positivstellensatz with universal quantifiers: if a polynomial f is positive on K, then f belongs to the associated quadratic module, under the archimedeanness assumption. Second, we prove some necessary and sufficient conditions for a full (or truncated) multisequence to admit a representing measure supported in K. In particular, the classical flat extension theorem of Curto and Fialkow is generalized to truncated moment problems on such a set K. Third, we present applications of the above Positivstellensatz and moment problems in semi-infinite optimization, where feasible sets are given by infinitely many constraints with universal quantifiers. This results in a new hierarchy of Moment-SOS relaxations. Its convergence is shown under some usual assumptions. The quantifier set Q is allowed to be non-semialgebraic, which makes it possible to solve some optimization problems with non-semialgebraic constraints. Funding: X. Hu and J. Nie are partially supported by the NSF [Grant DMS-2110780]. I. Klep is supported by the Slovenian Research Agency program P1-0222 [also Grants J1-50002, J1-60011, J1-50001, J1-2453, N1-0217, and J1-3004] and was partially supported by the Marsden Fund Council of the Royal Society of New Zealand. I. Klep’s work was partly performed within the project COMPUTE, funded within the QuantERA II program that has received funding from the EU’s H2020 research and innovation program under the GA No 101017733.
- 1 May 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 51 (2) , 1037-1060
Positivstellensätze and Moment Problems with Universal Quantifiers
This paper studies Positivstellensätze and moment problems for sets K that are given by universal quantifiers. Let Q be the closed set of universal quantifiers. Fix a finite nonnegative Borel measure whose support is Q and assume it satisfies the multivariate Carleman condition. First, we prove a Positivstellensatz with universal quantifiers: if a polynomial f is positive on K, then f belongs to the associated quadratic module, under the archimedeanness assumption. Second, we prove some necessary and sufficient conditions for a full (or truncated) multisequence to admit a representing measure supported in K. In particular, the classical flat extension theorem of Curto and Fialkow is generalized to truncated moment problems on such a set K. Third, we present applications of the above Positivstellensatz and moment problems in semi-infinite optimization, where feasible sets are given by infinitely many constraints with universal quantifiers. This results in a new hierarchy of Moment-SOS relaxations. Its convergence is shown under some usual assumptions. The quantifier set Q is allowed to be non-semialgebraic, which makes it possible to solve some optimization problems with non-semialgebraic constraints. Funding: X. Hu and J. Nie are partially supported by the NSF [Grant DMS-2110780]. I. Klep is supported by the Slovenian Research Agency program P1-0222 [also Grants J1-50002, J1-60011, J1-50001, J1-2453, N1-0217, and J1-3004] and was partially supported by the Marsden Fund Council of the Royal Society of New Zealand. I. Klep’s work was partly performed within the project COMPUTE, funded within the QuantERA II program that has received funding from the EU’s H2020 research and innovation program under the GA No 101017733.
- Open Access
- 10 February 2026
- Published by Springer Nature in Integral Equations and Operator Theory
- Vol. 98 (1) , 7
Positive operator-valued noncommutative polynomials are squares
We establish operator-valued versions of the earlier foundational factorization results for noncommutative polynomials due to Helton (Ann. Math., 2002) and one of the authors (Linear Alg. Appl., 2001). Specifically, we show that every positive operator-valued noncommutative polynomial p admits a single-square factorization $$p=r^{*}r$$ . An analogous statement holds for operator-valued noncommutative trigonometric polynomials (i.e., operator-valued elements of a free group algebra). Our approach follows the now standard sum-of-squares (sos) paradigm but requires new results and constructions tailored to operator coefficients. Assuming a positive p is not sos, Hahn–Banach separation yields a linear functional that is positive on the sos cone and negative on p ; a Gelfand–Naimark–Segal (GNS) construction then produces a representing tuple Y leading to contradiction since p was assumed positive on Y . The main technical input is a canonical tuple A of self-adjoint operators and, in the unitary case, a canonical tuple U of unitaries, both constructed from the left-regular representation on Fock space. We prove that, up to a universal constant, the norms $$\Vert p(A)\Vert $$ and $$\Vert p(U)\Vert $$ bound the operator norm of any positive semidefinite Gram matrix G representing the sos polynomial p . This uniform control is the key input in showing that the cone of (sums of) squares is closed in the product ultraweak topology on the coefficients. A separate approximation argument then produces a separating functional that is continuous for the weak operator topology (WOT). This two-step passage between the ultraweak and WOT topologies constitutes our separation argument and yields the required WOT closedness of the sos cone. With this in hand, the GNS construction associates to such a separating linear functional a finite-rank positive semidefinite noncommutative Hankel matrix and, on its range, produces the desired tuple Y .- 10 February 2026
- Published by Springer Nature in Integral Equations and Operator Theory
- Vol. 98 (1) , 7
Open AccessPositive operator-valued noncommutative polynomials are squares
We establish operator-valued versions of the earlier foundational factorization results for noncommutative polynomials due to Helton (Ann. Math., 2002) and one of the authors (Linear Alg. Appl., 2001). Specifically, we show that every positive operator-valued noncommutative polynomial p admits a single-square factorization $$p=r^{*}r$$ . An analogous statement holds for operator-valued noncommutative trigonometric polynomials (i.e., operator-valued elements of a free group algebra). Our approach follows the now standard sum-of-squares (sos) paradigm but requires new results and constructions tailored to operator coefficients. Assuming a positive p is not sos, Hahn–Banach separation yields a linear functional that is positive on the sos cone and negative on p ; a Gelfand–Naimark–Segal (GNS) construction then produces a representing tuple Y leading to contradiction since p was assumed positive on Y . The main technical input is a canonical tuple A of self-adjoint operators and, in the unitary case, a canonical tuple U of unitaries, both constructed from the left-regular representation on Fock space. We prove that, up to a universal constant, the norms $$\Vert p(A)\Vert $$ and $$\Vert p(U)\Vert $$ bound the operator norm of any positive semidefinite Gram matrix G representing the sos polynomial p . This uniform control is the key input in showing that the cone of (sums of) squares is closed in the product ultraweak topology on the coefficients. A separate approximation argument then produces a separating functional that is continuous for the weak operator topology (WOT). This two-step passage between the ultraweak and WOT topologies constitutes our separation argument and yields the required WOT closedness of the sos cone. With this in hand, the GNS construction associates to such a separating linear functional a finite-rank positive semidefinite noncommutative Hankel matrix and, on its range, produces the desired tuple Y . - Open Access
Inclusion constants for free spectrahedra with applications to quantum incompatibility
Building on the matrix cube problem, inclusions of free spectrahedra have been used successfully to obtain relaxations of hard spectrahedral inclusion problems. The quality of such a relaxation is quantified by the inclusion constant associated with each free spectrahedron. While optimal values of inclusion constants were known in certain highly symmetric cases, no general method for computing them was available. In this work, we show that inclusion constants for Cartesian products of free simplices can be computed using methods from non-commutative polynomial optimization, together with a detailed analysis of the extreme points of the associated free spectrahedra. This analysis also yields new closed-form analytic expressions for these constants. As an application to quantum information theory, we prove new bounds on the amount of white noise that incompatible measurements can tolerate before they become compatible. In particular, we study the case of one dichotomic and one $k$-outcome measurement, as well as the case of four dichotomic qubit measurements.
Open AccessInclusion constants for free spectrahedra with applications to quantum incompatibility
Building on the matrix cube problem, inclusions of free spectrahedra have been used successfully to obtain relaxations of hard spectrahedral inclusion problems. The quality of such a relaxation is quantified by the inclusion constant associated with each free spectrahedron. While optimal values of inclusion constants were known in certain highly symmetric cases, no general method for computing them was available. In this work, we show that inclusion constants for Cartesian products of free simplices can be computed using methods from non-commutative polynomial optimization, together with a detailed analysis of the extreme points of the associated free spectrahedra. This analysis also yields new closed-form analytic expressions for these constants. As an application to quantum information theory, we prove new bounds on the amount of white noise that incompatible measurements can tolerate before they become compatible. In particular, we study the case of one dichotomic and one $k$-outcome measurement, as well as the case of four dichotomic qubit measurements.
- Open Access
Exploiting Term Sparsity in Symmetry-Adapted Basis for Polynomial Optimization
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programming bounds. We consider problems where the objective function and constraint polynomials are invariant under the action of a finite group. The present paper simultaneously exploits group symmetry and term sparsity in order to reduce the computational cost of the hierarchy. We first exploit symmetry by writing the semidefinite matrices in a symmetry-adapted basis according to an isotypic decomposition. The matrices in such a basis are block diagonal. Secondly, we exploit term sparsity on each block to further reduce the optimization matrix variables. This is a non-trivial extension of the term sparsity-based hierarchy related to sign symmetry that was introduced by two of the authors. Our method is compared with existing techniques via benchmarks on quartics with dihedral, cyclic and symmetric group symmetry.
Open AccessExploiting Term Sparsity in Symmetry-Adapted Basis for Polynomial Optimization
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programming bounds. We consider problems where the objective function and constraint polynomials are invariant under the action of a finite group. The present paper simultaneously exploits group symmetry and term sparsity in order to reduce the computational cost of the hierarchy. We first exploit symmetry by writing the semidefinite matrices in a symmetry-adapted basis according to an isotypic decomposition. The matrices in such a basis are block diagonal. Secondly, we exploit term sparsity on each block to further reduce the optimization matrix variables. This is a non-trivial extension of the term sparsity-based hierarchy related to sign symmetry that was introduced by two of the authors. Our method is compared with existing techniques via benchmarks on quartics with dihedral, cyclic and symmetric group symmetry.
- Open Access
- 22 April 2025
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 8 (1) , #P1.11
Monoid algebras and graph products
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- 22 April 2025
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 8 (1) , #P1.11
Open AccessMonoid algebras and graph products
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- 4 March 2025
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 26 (3) , 1381-1423
Sums of Squares Certificates for Polynomial Moment Inequalities
- 4 March 2025
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 26 (3) , 1381-1423
Sums of Squares Certificates for Polynomial Moment Inequalities
- Open Access
- 16 January 2025
- Published by Springer Nature in Mathematische Zeitschrift
- Vol. 309 (3) , 1-20
A model theoretic perspective on matrix rings
In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $$M_n(K)$$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used together with invariant theory to prove quantifier elimination when K is an intersection of real closed fields. On the other hand, it is shown that finding a natural definable expansion with quantifier elimination of the theory of $$M_n(\mathbb {C})$$ is closely related to the infamous simultaneous conjugacy problem in matrix theory. Finally, for various natural structures describing dimension-free matrices it is shown that no such elimination results can hold by establishing undecidability results.- 16 January 2025
- Published by Springer Nature in Mathematische Zeitschrift
- Vol. 309 (3) , 1-20
Open AccessA model theoretic perspective on matrix rings
In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $$M_n(K)$$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used together with invariant theory to prove quantifier elimination when K is an intersection of real closed fields. On the other hand, it is shown that finding a natural definable expansion with quantifier elimination of the theory of $$M_n(\mathbb {C})$$ is closely related to the infamous simultaneous conjugacy problem in matrix theory. Finally, for various natural structures describing dimension-free matrices it is shown that no such elimination results can hold by establishing undecidability results. - Open Access
Complete Upper Bound Hierarchies for Spectral Minimum in Noncommutative Polynomial Optimization
This is the full/expanded/comprehensive version of the preliminary report https://laas.hal.science/hal-04440949v1
Open AccessComplete Upper Bound Hierarchies for Spectral Minimum in Noncommutative Polynomial Optimization
This is the full/expanded/comprehensive version of the preliminary report https://laas.hal.science/hal-04440949v1
- Open Access
Duality, extreme points and hulls for noncommutative partial convexity
This article studies generalizations of (matrix) convexity, including partial convexity and biconvexity, under the umbrella of $Γ$-convexity. Here $Γ$ is a tuple of free symmetric polynomials determining the geometry of a $Γ$-convex set. The paper introduces the notions of $Γ$-operator systems and $Γ$-ucp maps and establishes a Webster-Winkler type categorical duality between $Γ$-operator systems and $Γ$-convex sets. Next, a notion of an extreme point for $Γ$-convex sets is defined, paralleling the concept of a free extreme point for a matrix convex set. To ensure the existence of such points, the matricial sets considered are extended to include an operator level. It is shown that the $Γ$-extreme points of an operator $Γ$-convex set $K$ are in correspondence with the free extreme points of the operator convex hull of $Γ(K).$ From this result, a Krein-Milman theorem for $Γ$-convex sets follows. Finally, relying on the results of Helton and the first two authors, a construction of an approximation scheme for the $Γ$-convex hull of the matricial positivity domain {(also known as a free semialgebraic set)} $D_p$ of a free symmetric polynomial $p$ is given. The approximation consists of a decreasing family of $Γ$-analogs of free spectrahedra, whose projections, under mild assumptions, in the limit yield the $Γ$-convex hull of $D_p.$Open AccessDuality, extreme points and hulls for noncommutative partial convexity
This article studies generalizations of (matrix) convexity, including partial convexity and biconvexity, under the umbrella of $Γ$-convexity. Here $Γ$ is a tuple of free symmetric polynomials determining the geometry of a $Γ$-convex set. The paper introduces the notions of $Γ$-operator systems and $Γ$-ucp maps and establishes a Webster-Winkler type categorical duality between $Γ$-operator systems and $Γ$-convex sets. Next, a notion of an extreme point for $Γ$-convex sets is defined, paralleling the concept of a free extreme point for a matrix convex set. To ensure the existence of such points, the matricial sets considered are extended to include an operator level. It is shown that the $Γ$-extreme points of an operator $Γ$-convex set $K$ are in correspondence with the free extreme points of the operator convex hull of $Γ(K).$ From this result, a Krein-Milman theorem for $Γ$-convex sets follows. Finally, relying on the results of Helton and the first two authors, a construction of an approximation scheme for the $Γ$-convex hull of the matricial positivity domain {(also known as a free semialgebraic set)} $D_p$ of a free symmetric polynomial $p$ is given. The approximation consists of a decreasing family of $Γ$-analogs of free spectrahedra, whose projections, under mild assumptions, in the limit yield the $Γ$-convex hull of $D_p.$