A cutting-plane method without inclusions of approximating sets for conditional minimization

DOI10.1134/S1995080215020195MaRDI QIDQ748232zbMATH OpenFDO

Authors Igor Yaroslavich Zabotin, Rashid Samatovich Yarullin

Publication date 20 October 2015

Published in Lobachevskii Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

convergenceepigraphapproximating setconditional minimizationsequence of approximationscutting-plane method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Recommendations

• A cutting method for finding discrete minimax with dropping of cutting planes
• A cutting plane algorithm with an approximation of an epigraph
• One approach to constructing cutting algorithms with dropping of cutting planes
• A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems
• A cutting-plane method with updating of approximating sets and estimates of the solution accuracy

Cites work

• scientific article; zbMATH DE number 4063877 (Why is no real title available?)
• scientific article; zbMATH DE number 808805 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• New variants of bundle methods
• On several algorithms of immersion - cutoff for the problem of mathematical programming

Cited in

(9)

• A cutting plane algorithm with an approximation of an epigraph
• A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems
• Cutting plane oracles to minimize non-smooth non-convex functions
• Cutting-plane method based on epigraph approximation with discarding the cutting planes
• A minimization method with approximation of feasible set and epigraph of objective function
• A cutting method with updating approximating sets and its combination with other algorithms
• A cutting method and construction of mixed minimization algorithms on its basis
• One approach to constructing cutting algorithms with dropping of cutting planes
• A cutting-plane method with updating of approximating sets and estimates of the solution accuracy

This page was built for publication: A cutting-plane method without inclusions of approximating sets for conditional minimization

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