A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
From MaRDI portal
Publication:879567
DOI10.1016/j.amc.2006.05.208zbMath1116.65071OpenAlexW2020169097MaRDI QIDQ879567
Shao-Jian Qu, Ying Ji, Ke-Cun Zhang
Publication date: 14 May 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.208
branch-and-bound algorithmnonconvex programmingmathematical programmingsignomial geometric programmingLagrangian duality
Related Items
A Continuous Strategy to Solve a Class of Discrete Optimization Problems, Signomial and polynomial optimization via relative entropy and partial dualization, Range division and contraction algorithm for a class of global optimization problems, Global optimization of signomial geometric programming problems, Branch-reduction-bound algorithm for generalized geometric programming, A global optimization algorithm for signomial geometric programming problem, A robust algorithm for generalized geometric programming, A continuous strategy to solve a class of mixed optimization problems, The discrete ellipsoid covering problem: a discrete geometric programming approach, Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach
Cites Work
- Unnamed Item
- Unnamed Item
- Reduction of indefinite quadratic programs to bilinear programs
- Comparison of generalized geometric programming algorithms
- Generalized geometric programming applied to problems of optimal control. I: Theory
- Global minimization by reducing the duality gap
- Restricted multinomial maximum likelihood estimation based upon Fenchel duality
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Lagrange duality and partitioning techniques in nonconvex global optimization
- Prediction of oligopeptide conformations via deterministic global optimization
- Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Interval Newton iteration in multiple precision for the univariate case
- An algorithm for global minimization of linearly constrained quadratic functions
- Advances in interval methods for deterministic global optimization in chemical engineering
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- 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
