Pages that link to "Item:Q5322008"

The following pages link to Cutting Planes for Low-Rank-Like Concave Minimization Problems (Q5322008):

Displaying 10 items.

• An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
• Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
• Cutting plane oracles to minimize non-smooth non-convex functions (Q618887) (← links)
• Cutting plane/tabu search algorithms for low rank concave quadratic programming problems (Q1272984) (← links)
• The hill detouring method for minimizing hinging hyperplanes functions (Q1762167) (← links)
• Underestimation functions for a rank-two partitioning method (Q2026521) (← links)
• Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets (Q3192097) (← links)
• A new Lagrangian-Benders approach for a concave cost supply chain network design problem (Q5889193) (← links)
• A dual method for polar cuts in disjoint bilinear programming (Q6546113) (← links)
• A normal fan projection algorithm for low-rank optimization (Q6665394) (← links)