A Sparse Version of Reznick’s Positivstellensatz

Author:

Mai Ngoc Hoang Anh1,Magron Victor1ORCID,Lasserre Jean1ORCID

Affiliation:

1. Centre National de la Recherche Scientifique, Laboratory for Analysis and Architecture of Systems, F-31400 Toulouse; France

Abstract

If f is a positive definite form, Reznick’s Positivstellensatz states that there exists [Formula: see text] such that [Formula: see text] is a sum of squares of polynomials. Assuming that f can be written as a sum of forms [Formula: see text], where each fl depends on a subset of the initial variables, and assuming that these subsets satisfy the so-called running intersection property, we provide a sparse version of Reznick’s Positivstellensatz. Namely, there exists [Formula: see text] such that [Formula: see text], where σl is a sum of squares of polynomials, Hl is a uniform polynomial denominator, and both polynomials [Formula: see text] involve the same variables as fl for each [Formula: see text]. In other words, the sparsity pattern of f is also reflected in this sparse version of Reznick’s certificate of positivity. We next use this result to also obtain positivity certificates for (i) polynomials nonnegative on the whole space and (ii) polynomials nonnegative on a (possibly noncompact) basic semialgebraic set, assuming that the input data satisfy the running intersection property. Both are sparse versions of a positivity certificate from Putinar and Vasilescu. Funding: V. Magron was supported by the Fondation Mathématique Jacques Hadamard Programme Gaspard Monge for Optimization (Exact Polynomial Optimization with Innovative Certifed Schemes project). This work has benefited from the Tremplin European Research Council Starting [Grant ANR-18-ERC2-0004-01] (Tremplin-Certified Optimization for Cyber-Physical Systems project), the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Actions [Grant 813211] (Polynomial Optimization, Efficiency through Moments and Algebra) as well as from the Artificial Intelligence Interdisciplinary Institute Artificial and Natural Intelligence Toulouse Institute funding, through the French “Investing for the Future Programme d’Investissements d’Avenir3” program [Grant n°ANR-19-PI3A-0004].

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization;ACM Transactions on Mathematical Software;2022-12-19

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3