Global optimization of nonconvex polynomial programming problems having rational exponents
From MaRDI portal
Recommendations
- Global optimality conditions and optimization methods for polynomial programming problems
- On global optimizations with polynomials
- Global optimization for the generalized polynomial sum of ratios problem
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Global optimization of rational functions: a semidefinite programming approach
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- An approximate approach of global optimization for polynomial programming problems
- Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- Global optimization with polynomials and the problem of moments
Cited in
(35)- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- scientific article; zbMATH DE number 6263860 (Why is no real title available?)
- scientific article; zbMATH DE number 1857670 (Why is no real title available?)
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- Relative entropy relaxations for signomial optimization
- Global optimization for sum of geometric fractional functions
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A review of recent advances in global optimization
- Impossibility of extending Pólya's theorem to ``forms with arbitrary real exponents
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
- A tutorial on geometric programming
- Reformulations in Mathematical Programming: Definitions and Systematics
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- Multi-objective geometric programming problem with \(\epsilon\)-constraint method
- On generalized geometric programming problems with non-positive variables
- Global optimization of signomial geometric programming using linear relaxation.
- A new two-level linear relaxed bound method for geometric programming problems
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- Global optimization of generalized geometric programming
- Reduced RLT representations for nonconvex polynomial programming problems
- Global optimization of nonlinear sum of ratios problem
- On the posynomial fractional programming problems
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- Global optimization of rational functions: a semidefinite programming approach
- A global optimization algorithm for signomial geometric programming problem
- A geometric branch and bound method for robust maximization of convex functions
- Linearization method of global optimization for generalized geometric programming
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- A global optimization using linear relaxation for generalized geometric programming
- Newton polytopes and relative entropy optimization
- Branch-reduction-bound algorithm for generalized geometric programming
- Global optimization of general nonconvex problems with intermediate polynomial substructures
- Global optimization for sum of generalized fractional functions
- A branch and bound algorithm to globally solve the sum of several linear ratios
- Global optimality conditions and optimization methods for polynomial programming problems
This page was built for publication: Global optimization of nonconvex polynomial programming problems having rational exponents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1387651)
