Multiple Cuts in Separating Plane Algorithms

DOI10.1007/978-3-319-44914-2_34MaRDI QIDQ3133233zbMATH OpenOpenAlexFDO

Authors E. A. Nurminski

Publication date 13 February 2018

Published in Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44914-2_34

zbMATH Keywords

convex optimizationcutting planeconjugate functionseparating planecenter of gravity algorithm

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Cutting hyperplanes for divide-and-conquer
• Publication:4207787
• Multiple cuts in the analytic center cutting plane method
• A simple algorithm for the planar multiway cut problem
• Multiple cuts with a homogeneous analytic center cutting plane method
• An algorithm for the separation of two-row cuts
• A nontangential cutting plane algorithm
• Cutting plane algorithms for solving a stochastic edge-partition problem
• Algorithms for Multiterminal Cuts
• Geometric multicut: shortest fences for separating groups of objects in the plane

Cited in

(3)

• A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
• Synthesis of cutting and separating planes in a nonsmooth optimization method
• Multiple cuts in the analytic center cutting plane method

This page was built for publication: Multiple Cuts in Separating Plane Algorithms

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