Methods for solving multi-extremal problems (global search)

DOI10.1007/BF02283699MaRDI QIDQ811399zbMATH OpenOpenAlexFDO

Authors Valerian Bulatov

Publication date 1990

Published in Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

cutsglobal minimizationapproximation of convex setsLipschitz and concave functionsmulti- extremal problems

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• scientific article; zbMATH DE number 4031409
• Methods of finding the global minimum of a quasi-concave function
• scientific article; zbMATH DE number 47153
• On the global minimization of concave functions
• scientific article; zbMATH DE number 994413

Cites work

• scientific article; zbMATH DE number 3741114 (Why is no real title available?)
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
• Iterative Solution of Nonlinear Optimal Control Problems
• The Cutting-Plane Method for Solving Convex Programs

Cited in

(5)

• Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema
• On Search for All Roots of a System of Quadratic Equations
• Methods of finding the global minimum of a quasi-concave function
• scientific article; zbMATH DE number 4100970 (Why is no real title available?)
• scientific article; zbMATH DE number 4031409 (Why is no real title available?)

This page was built for publication: Methods for solving multi-extremal problems (global search)

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