Performance of approximate algorithms for global minimization

DOI10.1007/BFB0121019MaRDI QIDQ3217953zbMATH OpenFDO

Authors J. B. Rosen

Publication date 1984

Published in Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0121019

zbMATH Keywords

branch and bound algorithmscomputational analysiscomputational complexityepsilon-approximate solutionglobal minimizationlinear constraints

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30)

Recommendations

• A branch and bound-outer approximation algorithm for concave minimization over a convex set
• scientific article; zbMATH DE number 3913569
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
• A parallel algorithm for constrained concave quadratic global minimization
• An algorithm for global minimization of linearly constrained quadratic functions

Cited in

(6)

• Approximation algorithm for a class of global optimization problems
• Deterministic methods in constrained global optimization: Some recent advances and new fields of application
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Performance of Sine–Cosine Algorithm on Large-Scale Optimization Problems
• Estimating the characteristics of the accuracy and computational complexity in approximate methods of global optimization of nonlinear functionals
• Finding approximate local minima faster than gradient descent

This page was built for publication: Performance of approximate algorithms for global minimization

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