Local saddle points for unconstrained polynomial optimization

Wenjie Zhao () and Guangming Zhou ()
Additional contact information
Wenjie Zhao: Xiangtan University
Guangming Zhou: Xiangtan University

Computational Optimization and Applications, 2022, vol. 82, issue 1, No 4, 89-106

Abstract: Abstract This paper gives an algorithm for computing local saddle points for unconstrained polynomial optimization. It is based on optimality conditions and Lasserre’s hierarchy of semidefinite relaxations. It can determine the existence of local saddle points. When there are several different local saddle point values, the algorithm can get them from the smallest one to the largest one.

Keywords: Saddle point; Polynomial optimization; Lasserre’s hierarchy; Semidefinite relaxation; 90C22; 90C47; 49K35; 65K05 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-022-00361-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:82:y:2022:i:1:d:10.1007_s10589-022-00361-3

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-022-00361-3

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().