A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
From MaRDI portal
Publication:879567
DOI10.1016/J.AMC.2006.05.208zbMATH Open1116.65071OpenAlexW2020169097MaRDI QIDQ879567FDOQ879567
Kecun Zhang, Shaojian Qu, Ying Ji
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
Recommendations
- Global optimization of signomial geometric programming using linear relaxation.
- A global optimization algorithm for signomial geometric programming problem
- scientific article; zbMATH DE number 5209759
- A global optimization using linear relaxation for generalized geometric programming
- Accelerating method of global optimization for signomial geometric programming
branch-and-bound algorithmmathematical programmingnonconvex programmingsignomial geometric programmingLagrangian duality
Cites Work
- Interval Newton iteration in multiple precision for the univariate case
- Title not available (Why is that?)
- Generalized geometric programming applied to problems of optimal control. I: Theory
- Restricted multinomial maximum likelihood estimation based upon Fenchel duality
- 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
- Comparison of generalized geometric programming algorithms
- Global minimization by reducing the duality gap
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Prediction of oligopeptide conformations via deterministic global optimization
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Generalized Polynomial Optimization
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- Generalized Weighted Mean Programming
- Lagrange duality and partitioning techniques in nonconvex global optimization
- An algorithm for global minimization of linearly constrained quadratic functions
- Title not available (Why is that?)
- Reduction of indefinite quadratic programs to bilinear programs
- Advances in interval methods for deterministic global optimization in chemical engineering
Cited In (14)
- Signomial and polynomial optimization via relative entropy and partial dualization
- Range division and contraction algorithm for a class of global optimization problems
- A continuous strategy to solve a class of discrete optimization problems
- Title not available (Why is that?)
- Global optimization of signomial geometric programming problems
- Global optimization of signomial geometric programming using linear relaxation.
- A robust algorithm for generalized geometric programming
- A global optimization algorithm for signomial geometric programming problem
- Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach
- A continuous strategy to solve a class of mixed optimization problems
- The discrete ellipsoid covering problem: a discrete geometric programming approach
- Accelerating method of global optimization for signomial geometric programming
- Title not available (Why is that?)
- Branch-reduction-bound algorithm for generalized geometric programming
This page was built for publication: A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879567)
