A cutting method with updating approximating sets and its combination with other algorithms
zbMATH Open1343.65074MaRDI QIDQ307748FDOQ307748
Authors: Rashid Samatovich Yarullin, Igor Yaroslavich Zabotin
Publication date: 5 September 2016
Published in: The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)
Full work available at URL: http://isu.ru/journal/downloadArticle?article=_5c5094c5fd824cc29e17ca95ee82c01b&lang=rus
Recommendations
- A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems
- A minimization method with approximation of feasible set and epigraph of objective function
- A cutting plane algorithm with an approximation of an epigraph
- A cutting-plane method without inclusions of approximating sets for conditional minimization
- A cutting method for finding discrete minimax with dropping of cutting planes
convergenceepigraphapproximating setconditional minimizationcutting planeestimations accuracy of the solutionsequence of approximations
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)
Cites Work
Cited In (6)
- 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 method based on epigraph approximation with discarding the cutting planes
- A minimization method with approximation of feasible set and epigraph of objective function
- An efficient descent direction method with 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 method with updating approximating sets and its combination with other algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q307748)