Inscribed ball and enclosing box methods for the convex maximization problem
From MaRDI portal
Publication:5963240
DOI10.1007/s11590-015-0981-5zbMath1343.90067OpenAlexW2268284962MaRDI QIDQ5963240
Ider Tseveendorj, Guillaume Guérard
Publication date: 4 March 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0981-5
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Cites Work
- Piece adding technique for convex maximization problems
- On the global minimization of concave functions
- Iterative algorithms for Gram-Schmidt orthogonalization
- A collection of test problems for constrained global optimization algorithms
- Global optimality conditions for nonconvex optimization
- Finding robust solutions for product design problems
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Necessary and sufficient global optimality conditions for convex maximization revisited
- Introduction to global optimization
- An algorithm for maximizing a convex function over a simple set
- Methods for Global Concave Minimization: A Bibliographic Survey
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item