Solving generalized polynomial problem by using new affine relaxed technique
From MaRDI portal
Recommendations
- Branch-reduction-bound algorithm for generalized geometric programming
- A new linear relaxed method for solving generalized geometric programming
- A reliable affine relaxation method for global optimization
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- A new global optimization algorithm for solving generalized geometric programming
Cites work
- A branch \& cut technique to solve a weighted-sum of linear ratios
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- A branch-and-reduce approach to global optimization
- A Cutting Plane Approach for Chance Constrained Linear Programs
- A deterministic global optimization algorithm for generalized geometric programming
- A eighth bibliography of fractional programming
- A hybrid LP/NLP paradigm for global optimization relaxations
- A new bound-and-reduce approach of nonconvex quadratic programming problems
- A new linearization method for generalized linear multiplicative programming
- A new reformulation-linearization technique for bilinear programming problems
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- A polyhedral branch-and-cut approach to global optimization
- A practicable branch and bound algorithm for sum of linear ratios problem
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- A unified monotonic approach to generalized linear fractional programming
- Accelerating method of global optimization for signomial geometric programming
- An Efficient algorithm for quadratic sum-of-ratios fractional programs problem
- An outcome-space finite algorithm for solving linear multiplicative programming
- Analysis of bounds for multilinear functions
- BARON: A general purpose global optimization software package
- Branch-reduction-bound algorithm for generalized geometric programming
- Convex extensions and envelopes of lower semi-continuous functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Fractional programming: The sum-of-ratios case
- Global algorithm for solving linear multiplicative programming problems
- Global minimization of a generalized linear multiplicative programming
- Global optimization of multiplicative programs
- Global optimization of nonconvex problems with convex-transformable intermediates
- Global optimization of nonconvex problems with multilinear intermediates
- Global optimization of signomial geometric programming using linear relaxation.
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- Linear decomposition approach for a class of nonconvex programming problems
- Linearization method for a class of multiplicative programming with exponent
- Linearization method of global optimization for generalized geometric programming
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Quadratically constrained quadratic programming: Some applications and a method for solution
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- Relaxations of factorable functions with convex-transformable intermediates
- Semidefinite relaxations of fractional programs via novel convexification techniques
- The Boolean quadratic programming problem with generalized upper bound constraints
- The expansion of functions under transformation and its application to optimization
Cited in
(17)- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem
- Effective algorithm and computational complexity for solving sum of linear ratios problem
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- Generalized polynomial exponential sums and their fourth power mean
- Reduced outer space algorithm for globally computing affine sum-of-ratios problems
- An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule
- A novel affine relaxation-based algorithm for minimax affine fractional program
- An efficient algorithm via a novel one-parameter filled function based on general univariate functions for unconstrained global optimization
- Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs
- Image space branch-reduction-bound algorithm for globally solving the sum of affine ratios problem
- An outer space branch-reduction-bound algorithm using second-order cone relaxation with regional reduction strategy for solving equivalent generalized linear multiplicative programming
- Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme
- Output-space branch-and-bound algorithm adopting an adaptive branching rule for solving general linear fractional-multiplicative programs
- A new global optimization method based on separable relaxation for solving sum of linear ratios problem
- Global minimization of multimodal optimization with one-parameter filled function
This page was built for publication: Solving generalized polynomial problem by using new affine relaxed technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5063453)
