{
  "abstract": "This article presents an arithmetic, called superposition relaxation, for bracketing the graph of a multivariate factorable function on a compact domain between a pair of underestimating and overestimating functions that are both separable. Propagation rules are established for affine and nonlinear composition operations, with a focus on exploiting global monotonicity and convexity properties in the composition. The local convergence properties of this arithmetic are also analyzed in both the pointwise and Hausdorff sense, including conditions under which quadratic pointwise convergence propagates through composition. Parameterizations of the univariate summands in a superposition relaxation either as piecewise-constant or continuous piecewise-linear functions are discussed for a practical implementation. It is shown through numerical case studies that superposition relaxations can be consistently tighter than McCormick relaxations, including for the relaxation of artificial neural networks. But superposition relaxations also incur a higher computational cost than McCormick relaxations. Further investigations are thus warranted as applications in global optimization seek to balance a relaxation's tightness with its computational cost.",
  "abstract_shown": true,
  "affiliations": [
    "The Sargent Centre for Process Systems Engineering, Department of Chemical Engineering, Imperial College London, London, UK.",
    "DYSCO Unit, IMT School for Advanced Studies Lucca, Lucca, Italy.",
    "School of Information Science and Technology, ShanghaiTech University, Shanghai, China."
  ],
  "article_type": "research article",
  "arxiv": null,
  "author_total": 4,
  "authors": [
    {
      "affs": [
        0
      ],
      "name": "Yanlin Zha"
    },
    {
      "affs": [
        1
      ],
      "name": "Mario Eduardo Villanueva"
    },
    {
      "affs": [
        2
      ],
      "name": "Boris Houska"
    },
    {
      "affs": [
        0
      ],
      "name": "Benoît Chachuat",
      "orcid": "0000-0003-4780-9686"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/3ecea1x5wr8zy.bib",
  "cited_by": 0,
  "doi": "10.1007/s10898-026-01648-z",
  "fulltext_url": "https://europepmc.org/articles/PMC13710658",
  "id": "3ecea1x5wr8zy",
  "issns": [
    "0925-5001",
    "1573-2916"
  ],
  "landing_url": "https://europepmc.org/article/MED/42948171",
  "language": "eng",
  "licence": "CC-BY",
  "licence_label": "CC BY",
  "licence_source": "article",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "heading",
      "Article"
    ],
    [
      "openalex",
      "2612|Advanced Optimization Algorithms Research"
    ]
  ],
  "openalex": "W7160960983",
  "pdf_url": "https://europepmc.org/articles/PMC13710658?pdf=render",
  "pmcid": "PMC13710658",
  "pmid": "42948171",
  "published": "2026-10-01",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/3ecea1x5wr8zy.ris",
  "sources": [
    {
      "first_seen": "2026-10-31T00:20:35Z",
      "native_id": "MED:42948171",
      "source": "europepmc",
      "url": "https://europepmc.org/article/MED/42948171"
    },
    {
      "first_seen": "2026-10-31T12:21:35Z",
      "native_id": "PMC13710658",
      "source": "pmc",
      "url": "https://doi.org/10.1007/s10898-026-01648-z"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "openalex:2612|Advanced Optimization Algorithms Research",
      "subfield": "numerical-analysis"
    }
  ],
  "title": "Relaxation via separable estimators: arithmetic and implementation.",
  "title_text": "Relaxation via separable estimators: arithmetic and implementation.",
  "type": "peer-reviewed",
  "updated_at": "2026-10-31T12:21:35Z",
  "url": "https://research.draconitic.com/paper/3ecea1x5wr8zy",
  "venue": "Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering",
  "versions": []
}