Pages that link to "Item:Q1387651"
From MaRDI portal
The following pages link to Global optimization of nonconvex polynomial programming problems having rational exponents (Q1387651):
Displaying 34 items.
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
- Global optimization of nonlinear sum of ratios problem (Q702537) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- On generalized geometric programming problems with non-positive variables (Q857357) (← links)
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation (Q879567) (← links)
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
- Impossibility of extending Pólya's theorem to ``forms'' with arbitrary real exponents (Q949641) (← links)
- Global optimization for sum of geometric fractional functions (Q983970) (← links)
- A tutorial on geometric programming (Q1027158) (← links)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique (Q1187374) (← links)
- Global optimization of signomial geometric programming using linear relaxation. (Q1428180) (← links)
- A global optimization algorithm for signomial geometric programming problem (Q1722230) (← links)
- Linearization method of global optimization for generalized geometric programming (Q1763283) (← links)
- A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
- Global optimization of generalized geometric programming (Q1779583) (← links)
- On the posynomial fractional programming problems (Q1848628) (← links)
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) (← links)
- Multi-objective geometric programming problem with \(\epsilon\)-constraint method (Q1991380) (← links)
- A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
- Newton polytopes and relative entropy optimization (Q2067684) (← links)
- Global optimization of general nonconvex problems with intermediate polynomial substructures (Q2250104) (← links)
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- Branch-reduction-bound algorithm for generalized geometric programming (Q2392111) (← links)
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models (Q2424760) (← links)
- A global optimization using linear relaxation for generalized geometric programming (Q2427180) (← links)
- Global optimization for sum of generalized fractional functions (Q2479363) (← links)
- Global optimization of rational functions: a semidefinite programming approach (Q2490324) (← links)
- A branch and bound algorithm to globally solve the sum of several linear ratios (Q2572656) (← links)
- Relative entropy relaxations for signomial optimization (Q2805708) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- (Q5400057) (← links)
