A deterministic global optimization algorithm for generalized geometric programming
From MaRDI portal
Publication:2572718
DOI10.1016/j.amc.2005.01.142zbMath1105.65335OpenAlexW2044056253MaRDI QIDQ2572718
Publication date: 4 November 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.01.142
algorithmglobal optimizationreverse convex programmingrobust stabilitynumerical experimentgeometric programmingbranch and bound methodcutting-plane method
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
A Continuous Strategy to Solve a Class of Discrete Optimization Problems ⋮ Signomial and polynomial optimization via relative entropy and partial dualization ⋮ 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 ⋮ Branch-reduction-bound algorithm for generalized geometric programming ⋮ Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs ⋮ Two-level linear relaxation method for generalized linear fractional programming ⋮ Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models ⋮ 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 accelerating method for globally solving a class of nonconvex programming problems ⋮ Global optimization for generalized linear multiplicative programming using convex relaxation ⋮ A global optimization algorithm for signomial geometric programming problem ⋮ A novel optimization method for nonconvex quadratically constrained quadratic programs ⋮ A robust algorithm for generalized geometric programming ⋮ An effective algorithm for globally solving quadratic programs using parametric linearization technique ⋮ A continuous strategy to solve a class of mixed optimization problems ⋮ The discrete ellipsoid covering problem: a discrete geometric programming approach ⋮ A deterministic method for solving the sum of linear ratios problem ⋮ A branch and bound algorithm for globally solving a class of nonconvex programming problems ⋮ A nonisolated optimal solution for special reverse convex programming problems ⋮ Convexity of products of univariate functions and convexification transformations for geometric programming ⋮ A geometric branch and bound method for robust maximization of convex functions ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints ⋮ Global optimization for generalized geometric programming problems with discrete variables
Cites Work
- A stochastic geometric programming problem with multiplicative recourse
- Generalized geometric programming applied to problems of optimal control. I: Theory
- Restricted multinomial maximum likelihood estimation based upon Fenchel duality
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Prediction of oligopeptide conformations via deterministic global optimization
- Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach
- Geometric programming with signomials
- Effectiveness of a geometric programming algorithm for optimization of machining economics models
- Allocation of resources in project management
- Generalized Polynomial Optimization
- Generalized Weighted Mean Programming
- Unnamed Item
This page was built for publication: A deterministic global optimization algorithm for generalized geometric programming
