Linearization method of global optimization for generalized geometric programming
From MaRDI portal
Publication:1763283
DOI10.1016/j.amc.2003.12.101zbMath1071.65089OpenAlexW2019047490MaRDI QIDQ1763283
Publication date: 22 February 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2003.12.101
algorithmglobal optimizationconvergencelinearizationnumerical examplesbranch-and-boundgeneralized geometric programmingbisection rule
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)
Related Items
Global optimization of signomial geometric programming problems, A review of recent advances in global optimization, A MILP formulation for generalized geometric programming using piecewise-linear approximations, A parametric linearizing approach for quadratically inequality constrained quadratic programs, Solving generalized polynomial problem by using new affine relaxed technique, Single-projection procedure for linear optimization, A deterministic global optimization algorithm based on a linearizing method for nonconvex quadratically constrained programs, Computational method for the profit bounds of inventory model with interval demand and unit cost, Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs, Two-level linear relaxation method for generalized linear fractional programming, A new global optimization algorithm for solving generalized geometric programming, Multi-parametric disaggregation technique for global optimization of polynomial programming problems, Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems, A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming, A new bound-and-reduce approach of nonconvex quadratic programming problems, A novel optimization method for nonconvex quadratically constrained quadratic programs, An effective algorithm for globally solving quadratic programs using parametric linearization technique, The discrete ellipsoid covering problem: a discrete geometric programming approach, Fuzzy profit measures for a fuzzy economic order quantity model, A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints, Relative Entropy Relaxations for Signomial Optimization, Convexity of products of univariate functions and convexification transformations for geometric programming, Newton polytopes and relative entropy optimization, An effective global optimization algorithm for quadratic programs with quadratic constraints
Cites Work
- 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
- Constrained global optimization: algorithms and applications
- 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
- Primal-relaxed dual global optimization approach
- 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
- 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
- A set of geometric programming test problems and their solutions
- Generalized Polynomial Optimization
- Generalized Weighted Mean Programming
