Global optimality conditions and optimization methods for polynomial programming problems
Global optimality conditions and optimization methods for polynomial programming problems
About this item
Publication information
Publisher
New York: Springer US
Subjects
More information
Scope and Contents
Contents
This paper is concerned with the general polynomial programming problem with box constraints, including global optimality conditions and optimization methods. First, a necessary global optimality condition for a general polynomial programming problem with box constraints is given. Then we design a local optimization method by using the necessary gl...
Alternative Titles
Full title
Global optimality conditions and optimization methods for polynomial programming problems
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1730056099
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1730056099
Other Identifiers
ISSN
0925-5001
E-ISSN
1573-2916
DOI
10.1007/s10898-015-0292-5
How to access this item
Log in as a Library member
