A global optimization using linear relaxation for generalized geometric programming
From MaRDI portal
Publication:2427180
DOI10.1016/j.ejor.2007.06.034zbMath1146.90073OpenAlexW2047939651WikidataQ126238621 ScholiaQ126238621MaRDI QIDQ2427180
Shao-Jian Qu, Ke-Cun Zhang, Fu-Sheng Wang
Publication date: 8 May 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.06.034
Related Items
Range division and contraction algorithm for a class of global optimization problems, Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions, A MILP formulation for generalized geometric programming using piecewise-linear approximations, Branch-reduction-bound algorithm for generalized geometric programming, A model-hybrid approach for unconstrained optimization problems, A practicable contraction approach for the sum of the generalized polynomial ratios problem, A new hybrid method for solving global optimization problem, Unnamed Item, Global minimization for generalized polynomial fractional program, A global optimization algorithm for signomial geometric programming problem, Global optimization for the generalized polynomial sum of ratios problem, Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints, A novel mutation operator based on the immunity operation, Hybrid optimization procedure applied to optimal location finding for piezoelectric actuators and sensors for active vibration control, Global optimization for generalized geometric programming problems with discrete variables
Cites Work
- Unnamed Item
- Unnamed Item
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- Reduction of indefinite quadratic programs to bilinear programs
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Comparison of generalized geometric programming algorithms
- Generalized geometric programming applied to problems of optimal control. I: Theory
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Prediction of oligopeptide conformations via deterministic global optimization
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Global optimization of signomial geometric programming using linear relaxation.
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- The expansion of functions under transformation and its application to optimization
- Geometric Programming: Methods, Computations and Applications
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Generalized Polynomial Optimization
- Generalized Weighted Mean Programming
