Methods of multiextremal optimization under constraints for separably quasimonotone functions

DOI10.1134/S1064230711020134MaRDI QIDQ357786zbMATHFDO

Authors Yu. A. Zak

Publication date 13 August 2013

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound methodmultiextremal optimizationnonconvex constraintsseparably quasimonotone functions

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 3924526
• Optimization problems with unimodal functions in max-separabal constraints
• scientific article; zbMATH DE number 994413
• Methods of finding the global minimum of a quasi-concave function
• Monotonic optimization: Problems and solution approaches

Cites work

• scientific article; zbMATH DE number 3875040 (Why is no real title available?)
• scientific article; zbMATH DE number 1330052 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• An Algorithm for the Traveling Salesman Problem
• Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems
• Global optimization to prescribed accuracy
• Global optimization with non-convex constraints. Sequential and parallel algorithms

Cited in

(3)

• A method for solving multi-extremal problems with non-convex constraints, that uses a priori information about estimates of the optimum
• On alternative optimal solutions to quasimonotonic programming with linear constraints
• scientific article; zbMATH DE number 3924526 (Why is no real title available?)

This page was built for publication: Methods of multiextremal optimization under constraints for separably quasimonotone functions

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