Global maximization of special classes of convex functions on a convex polyhedral set
From MaRDI portal
Publication:1802610
zbMATH Open0781.90075MaRDI QIDQ1802610FDOQ1802610
Authors: Rafail Gabasov, Faina Mihaǐlovna Kirillova, E. A. Kostina
Publication date: 6 September 1993
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Recommendations
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (12)
- Title not available (Why is that?)
- ON THE MAXIMIZATION OF A CLASS OF FUNCTIONALS ON CONVEX REGIONS, AND THE CHARACTERIZATION OF THE FARTHEST CONVEX SET
- Attractive force search algorithm for piecewise convex maximization problems
- Title not available (Why is that?)
- On the equivalence between some discrete and continuous optimization problems
- The search for a global maximum of a convex functional on an admissible set
- Title not available (Why is that?)
- On a class of functions attaining their maximum at the vertices of a polyhedron
- Title not available (Why is that?)
- Optimization of Globally Convex Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Global maximization of special classes of convex functions on a convex polyhedral set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802610)