Methods of multiextremal optimization under constraints for separably quasimonotone functions

DOI10.1134/S1064230711020134zbMATH Open1270.49029MaRDI QIDQ357786FDOQ357786

Authors: Yu. A. Zak 

Publication date: 13 August 2013

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

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

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)

Cites Work

• Title not available (Why is that?)
• An Algorithm for the Traveling Salesman Problem
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Global optimization to prescribed accuracy
• Title not available (Why is that?)
• Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems
• Title not available (Why is that?)

Cited In (3)

• On alternative optimal solutions to quasimonotonic programming with linear constraints
• Title not available (Why is that?)
• A method for solving multi-extremal problems with non-convex constraints, that uses a priori information about estimates of the optimum

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)