Cutting Planes for Low-Rank-Like Concave Minimization Problems

DOI10.1287/OPRE.1040.0151MaRDI QIDQ5322008zbMATH OpenOpenAlexFDO

Authors Marcus Porembski

Publication date 17 July 2009

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.1040.0151

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• Cone adaptation strategies for a finite and exact cutting plane algorithm for concave minimization
• Cutting plane/tabu search algorithms for low rank concave quadratic programming problems
• On the hierarchy of γ-valid cuts in global optimization
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
• Concave minimization via conical partitions and polyhedral outer approximation

Cited in

(9)

• Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
• Cutting plane oracles to minimize non-smooth non-convex functions
• The hill detouring method for minimizing hinging hyperplanes functions
• Underestimation functions for a rank-two partitioning method
• Linear decomposition approach for a class of nonconvex programming problems
• A new Lagrangian-Benders approach for a concave cost supply chain network design problem
• A normal fan projection algorithm for low-rank optimization
• An FPTAS for optimizing a class of low-rank functions over a polytope
• A dual method for polar cuts in disjoint bilinear programming

This page was built for publication: Cutting Planes for Low-Rank-Like Concave Minimization Problems

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