A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation

DOI10.1016/J.AMC.2006.05.208MaRDI QIDQ879567zbMATH OpenOpenAlexFDO

Authors Shaojian Qu, Ying Ji, Kecun 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

zbMATH Keywords

branch-and-bound algorithmmathematical programmingnonconvex programmingsignomial geometric programmingLagrangian duality

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

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

Cites work

• scientific article; zbMATH DE number 3537446 (Why is no real title available?)
• scientific article; zbMATH DE number 757677 (Why is no real title available?)
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• Advances in interval methods for deterministic global optimization in chemical engineering
• Allocation of resources in project management
• An algorithm for global minimization of linearly constrained quadratic functions
• An infeasible interior-point algorithm for solving primal and dual geometric programs
• Comparison of generalized geometric programming algorithms
• Effectiveness of a geometric programming algorithm for optimization of machining economics models
• Generalized Polynomial Optimization
• Generalized Weighted Mean Programming
• Generalized geometric programming applied to problems of optimal control. I: Theory
• Geometric programming with signomials
• Global minimization by reducing the duality gap
• Global optimization of nonconvex polynomial programming problems having rational exponents
• Interval Newton iteration in multiple precision for the univariate case
• Lagrange duality and partitioning techniques in nonconvex global optimization
• Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach
• Prediction of oligopeptide conformations via deterministic global optimization
• Reduction of indefinite quadratic programs to bilinear programs
• Restricted multinomial maximum likelihood estimation based upon Fenchel duality

Cited in

(14)

• A continuous strategy to solve a class of mixed optimization problems
• The discrete ellipsoid covering problem: a discrete geometric programming approach
• A robust algorithm for generalized geometric programming
• scientific article; zbMATH DE number 5209759 (Why is no real title available?)
• Range division and contraction algorithm for a class of global optimization problems
• A global optimization algorithm for signomial geometric programming problem
• Signomial and polynomial optimization via relative entropy and partial dualization
• scientific article; zbMATH DE number 5169224 (Why is no real title available?)
• Branch-reduction-bound algorithm for generalized geometric programming
• Accelerating method of global optimization for signomial geometric programming
• A continuous strategy to solve a class of discrete optimization problems
• Global optimization of signomial geometric programming problems
• Global optimization of signomial geometric programming using linear relaxation.
• Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach

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)