Cutting-plane method based on epigraph approximation with discarding the cutting planes

DOI10.1134/S0005117915110065zbMath1338.90467MaRDI QIDQ276160

Igor' Yaroslavich Zabotin, Rashid Samatovich Yarullin

Publication date: 27 April 2016

Published in: Automation and Remote Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (4)

Analytic center cutting plane methods for variational inequalities over convex bodies ⋮ One variant of the objective function parameterization method and its implementation ⋮ Constrained integer fractional programming problem with box constraints ⋮ Constructing Mixed Algorithms on the Basis of Some Bundle Method

Cites Work

• On several algorithms of immersion - cutoff for the problem of mathematical programming
• New variants of bundle methods
• The Cutting-Plane Method for Solving Convex Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cutting-plane method based on epigraph approximation with discarding the cutting planes