Methods for solving multi-extremal problems (global search)

DOI10.1007/BF02283699zbMATH Open0734.90070OpenAlexW2092986824MaRDI QIDQ811399FDOQ811399

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

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

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)

Cites Work

• The Cutting-Plane Method for Solving Convex Programs
• Iterative Solution of Nonlinear Optimal Control Problems
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema
• Methods of finding the global minimum of a quasi-concave function
• On Search for All Roots of a System of Quadratic Equations
• Title not available (Why is that?)

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)