Global optimality conditions and optimization methods for constrained polynomial programming problems
type: Item
instance of: scholarly article
title: Global optimality conditions and optimization methods for constrained polynomial programming problems
zbMATH Open document ID: 1410.90206
author: Jing Tian
author: Julien Ugon
author: L. Zhang
author: Zhiyou Wu
published in: Applied Mathematics and Computation
publication date: 2018-08-21T00:00:00Z
full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/92549
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6921543
zbMATH Keywords: constrained polynomial programming problem
zbMATH Keywords: necessary global optimality condition
zbMATH Keywords: linear transformation
zbMATH Keywords: local optimization method
zbMATH Keywords: global optimization method
describes a project that uses: GloptiPoly
describes a project that uses: Eigensolve
describes a project that uses: SeDuMi
MaRDI profile type: Publication
OpenAlex ID: W248636453
cites work: A collection of test problems for constrained global optimization algorithms
cites work: Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
cites work: Regularization methods for SDP relaxations in large-scale polynomial optimization
cites work: A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
cites work: Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
cites work: Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints
cites work: Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
cites work: Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
cites work: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
cites work: Transposition Theorems and Qualification‐Free Optimality Conditions
cites work: Global optimization with polynomials and the problem of moments
cites work: Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
cites work: Unconstrained and constrained global optimization of polynomial functions in one variable
cites work: New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
cites work: An iterated eigenvalue algorithm for approximating roots of univariate polynomials
cites work: Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
cites work: Nonlinear Programming
cites work: A novel filled function method and quasi-filled function method for global optimization
cites work: Experimental testing of advanced scatter search designs for global optimization of multimodal functions
cites work: GloptiPoly
cites work: GloptiPoly 3: moments, optimization and semidefinite programming
DOI: 10.1016/J.AMC.2015.04.040
description: scientific article; zbMATH DE number 6921543