.png){kind=icon}
Return
Degree reduction techniques for polynomial optimization problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2024.12.021.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents anew approach to quadrify a polynomial programming problem, i.e. reduce the polynomial program to a quadratic program, before solving it. The proposed approach, QUAD-RLT, exploits the Reformulation-Linearization Technique (RLT) structure to obtain smaller relaxations that can be solved faster and still provide high quality bounds. QUAD-RLT is compared to other quadrification techniques that have been previously discussed in the literature. The paper presents theoretical as well as computational results showing the advantage of QUAD-RLT compared to other quadrification techniques. Furthermore, rather than quadrifying a polynomial program, QUAD-RLT is generalized to reduce the degree of the polynomial to any degree. Computational results show that reducing the degree of the polynomial to a degree that is higher than two provides computational advantages in certain cases compared to fully quadrifying the problem. Finally, QUAD-RLT along with other quadrification/degree reduction schemes are implemented and made available in the freely available software RAPOSa.
Keywords:
Nonlinear programming
Quadrification
Degree reduction
Reformulation-linearization technique
Polynomial programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
ShareSaveShareSaveDistribution of breeding songbirds in Bradfield Woods, Suffolk, in relation to vegetation and coppice management.png)
Bird Study
Bird StudyIF0
PREAI
ShareSaveShareSaveShareSave
View more