PCPOP.jl: A Julia package for partially commutative polynomial optimization

• URL: http://arxiv.org/abs/2607.09339v2
• Date: Mon, 13 Jul 2026 01:52:43 GMT
• Title: PCPOP.jl: A Julia package for partially commutative polynomial optimization
• Abstract summary: PCPOP is a Julia package for optimization that supports non-commutative optimization, t-racial optimization, trace optimization and state optimization.<n>PCPOP implements a specialized framework for computations in partially commutative variables that provides significant computational advantages for problems appearing in algebra information.
• Score: 1.389385993711899
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Here we present PCPOP, a Julia package for polynomial optimization that supports non-commutative optimization, tracial polynomial optimization, trace polynomial optimization and state polynomial optimization. PCPOP fully supports exact arithmetic computations and incorporates convenient functionalities such as algebraic reductions based on Gröbner basis methods, automatized symmetrization via Wedderburn decompositions, and Jordan algebra reductions. As a distinguished feature, PCPOP implements a specialized framework for polynomial computations in partially commutative variables that provides significant computational advantages for problems appearing in quantum information.

Related papers

• (MPO)$^2$: Multivariate Polynomial Optimization based on Matrix Product Operators [6.420068890493834]
  We introduce Multi Polynomial based on Matrix Product Operators (MPO)$2$, a framework that combines learned MPO feature embeddings with compact weight tensors.<n>Across regression and classification benchmarks, (MPO)$2$ improves over existing tensor decomposition based models and provides a flexible alternative for efficient function approximation.
  arXiv  Detail & Related papers  (2026-07-17T12:44:48Z)
• Partially-Commutative Polynomial Optimization [1.236218755528715]
  We show how a partially-commutative monoid can be used to build SDP relaxations for partially-commutative optimization problems.<n>We show how they can be used to build SDP relaxations for partially-commutative optimization problems in which the partial commutations are implemented in the monomial structure.
  arXiv  Detail & Related papers  (2026-07-09T18:01:42Z)
• The Complexity of Min-Max Optimization for Quadratic Polynomials [71.85811744604827]
  We prove that computing approximate stationary points of min-max optimization over the hypercube is PPAD-hard for quadratics.<n>As a direct consequence, we obtain the first PPAD-hardness results for two-team zero-sum polymatrix.
  arXiv  Detail & Related papers  (2026-06-15T17:37:13Z)
• Complementary polynomials in quantum signal processing [0.0]
  To implement a given $P$, one must first construct a corresponding complementary $Q$.<n>Existing approaches to this problem employ numerical methods that are not amenable to explicit error analysis.<n>We present a new approach to complementarys using complex analysis.
  arXiv  Detail & Related papers  (2024-06-06T16:47:11Z)
• Analyzing and Enhancing the Backward-Pass Convergence of Unrolled Optimization [50.38518771642365]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. A central challenge in this setting is backpropagation through the solution of an optimization problem, which often lacks a closed form. This paper provides theoretical insights into the backward pass of unrolled optimization, showing that it is equivalent to the solution of a linear system by a particular iterative method. A system called Folded Optimization is proposed to construct more efficient backpropagation rules from unrolled solver implementations.
  arXiv  Detail & Related papers  (2023-12-28T23:15:18Z)
• Covering Number of Real Algebraic Varieties and Beyond: Improved Bounds and Applications [8.438718130535296]
  We prove upper bounds on the covering number of numerous sets in Euclidean space.<n>We illustrate the power of the result on three computational applications.
  arXiv  Detail & Related papers  (2023-11-09T03:06:59Z)
• Sparse Polynomial Optimization: Theory and Practice [5.27013884159732]
  Book presents several efforts to tackle this challenge with important scientific implications. It provides alternative optimization schemes that scale well in terms of computational complexity. We present sparsity-exploiting hierarchies of relaxations, for either unconstrained or constrained problems.
  arXiv  Detail & Related papers  (2022-08-23T18:56:05Z)
• Non-Convex Optimization with Certificates and Fast Rates Through Kernel Sums of Squares [68.8204255655161]
  We consider potentially non- optimized approximation problems. In this paper, we propose an algorithm that achieves close to optimal a priori computational guarantees.
  arXiv  Detail & Related papers  (2022-04-11T09:37:04Z)
• A Reinforcement Learning Environment for Polyhedral Optimizations [68.8204255655161]
  We propose a shape-agnostic formulation for the space of legal transformations in the polyhedral model as a Markov Decision Process (MDP) Instead of using transformations, the formulation is based on an abstract space of possible schedules. Our generic MDP formulation enables using reinforcement learning to learn optimization policies over a wide range of loops.
  arXiv  Detail & Related papers  (2021-04-28T12:41:52Z)
• Automatic differentiation for Riemannian optimization on low-rank matrix and tensor-train manifolds [71.94111815357064]
  In scientific computing and machine learning applications, matrices and more general multidimensional arrays (tensors) can often be approximated with the help of low-rank decompositions. One of the popular tools for finding the low-rank approximations is to use the Riemannian optimization.
  arXiv  Detail & Related papers  (2021-03-27T19:56:00Z)
• Divide and Learn: A Divide and Conquer Approach for Predict+Optimize [50.03608569227359]
  The predict+optimize problem combines machine learning ofproblem coefficients with a optimization prob-lem that uses the predicted coefficients. We show how to directlyexpress the loss of the optimization problem in terms of thepredicted coefficients as a piece-wise linear function. We propose a novel divide and algorithm to tackle optimization problems without this restriction and predict itscoefficients using the optimization loss.
  arXiv  Detail & Related papers  (2020-12-04T00:26:56Z)
• Quantum Gradient Algorithm for General Polynomials [5.008814514502094]
  Gradient-based algorithms, popular strategies to optimization problems, are essential for many modern machine-learning techniques. We propose a quantum gradient algorithm for optimizing numericals with the dressed amplitude. For the potential values in high-dimension optimizations, this quantum algorithm is supposed to facilitate gradient-optimizations.
  arXiv  Detail & Related papers  (2020-04-23T11:28:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.