A note on a deterministic global optimization algorithm

DOI10.1016/J.AMC.2008.01.021MaRDI QIDQ941475zbMATH OpenOpenAlexFDO

Authors Hong-Wei Jiao, Yongqiang Chen

Publication date 1 September 2008

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2008.01.021

zbMATH Keywords

global optimizationalgorithmbranch and boundlinear relaxationlinear sum of ratios

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A deterministic algorithm for global optimization
• A deterministic algorithm for global optimization
• A deterministic global optimization algorithm
• A deterministic global optimization algorithm
• Deterministic global optimization. Theory, methods and applications
• scientific article; zbMATH DE number 494358
• Some recent developments in deterministic global optimization
• A deterministic algorithm for global multi-objective optimization
• scientific article; zbMATH DE number 778142
• scientific article; zbMATH DE number 47153

Cites work

• A deterministic global optimization algorithm

Cited in

(7)

• A practicable branch and bound algorithm for sum of linear ratios problem
• Global optimization algorithm for sum of generalized polynomial ratios problem
• Study of multiscale global optimization based on parameter space partition
• Outcome space range reduction method for global optimization of sum of affine ratios problem
• A linearized relaxing algorithm for the specific nonlinear optimization problem
• A deterministic global optimization algorithm
• Global optimization for sum of linear ratios problem using new pruning technique

This page was built for publication: A note on a deterministic global optimization algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941475)