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

DOI10.1134/S1995080215020195zbMATH Open1330.65092MaRDI QIDQ748232FDOQ748232

Authors: Igor Yaroslavich Zabotin, Rashid Samatovich Yarullin 

Publication date: 20 October 2015

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

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

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)

Cites Work

• New variants of bundle methods
• Title not available (Why is that?)
• On several algorithms of immersion - cutoff for the problem of mathematical programming
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Cutting plane oracles to minimize non-smooth non-convex functions
• One approach to constructing cutting algorithms with dropping of cutting planes

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)