Global optimization of nonconvex polynomial programming problems having rational exponents
type: Item
instance of: scholarly article
title: Global optimization of nonconvex polynomial programming problems having rational exponents
zbMATH Open document ID: 0905.90146
DOI: 10.1023/A:1008249414776
author: Hanif D. Sherali
published in: Journal of Global Optimization
publication date: 1998-06-08T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1160079
zbMATH Keywords: global optimization
zbMATH Keywords: nonconvex polynomial programming
zbMATH Keywords: reformulation-linearization technique
zbMATH Keywords: branch-and-bound
describes a project that uses: HOMPACK
MaRDI profile type: Publication
full work available at URL: a:1008249414776
OpenAlex ID: W2040529625
Recommended article: Global optimality conditions and optimization methods for polynomial programming problems
Recommended article: On global optimizations with polynomials
Recommended article: Global optimization for the generalized polynomial sum of ratios problem
Recommended article: Global optimality conditions and optimization methods for constrained polynomial programming problems
Recommended article: Global optimization of rational functions: a semidefinite programming approach
Recommended article: Global optimization of general nonconvex problems with intermediate polynomial substructures
Recommended article: An approximate approach of global optimization for polynomial programming problems
Recommended article: Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
Recommended article: Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
Recommended article: Global optimization with polynomials and the problem of moments
description: scientific article; zbMATH DE number 1160079