Saddle points of rational functions

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

Computational Optimization and Applications, 2020, vol. 75, issue 3, No 11, 817-832

Abstract: Abstract This paper concerns saddle points of rational functions, under general constraints. Based on optimality conditions, we propose an algorithm for computing saddle points. It uses Lasserre’s hierarchy of semidefinite relaxation. The algorithm can get a saddle point if it exists, or it can detect its nonexistence if it does not. Numerical experiments show that the algorithm is efficient for computing saddle points of rational functions.

Keywords: Saddle point; Rational function; Polynomial; Lasserre’s hierarchy (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-019-00141-6 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:75:y:2020:i:3:d:10.1007_s10589-019-00141-6

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

DOI: 10.1007/s10589-019-00141-6

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 ().