A cutting method and construction of mixed minimization algorithms on its basis

MaRDI QIDQ2815064zbMATH OpenFDO

Authors O. N. Shulgina, Igor Yaroslavich Zabotin, Rashid Samatovich Yarullin

Publication date 27 June 2016

Published in Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/uzku1276

zbMATH Keywords

approximation setconditional minimizationconvergencecutting planemixed algorithmssequence of approximation

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• A cutting-plane method without inclusions of approximating sets for conditional minimization
• A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems
• One approach to constructing cutting algorithms with dropping of cutting planes
• Constructing mixed algorithms on the basis of some bundle method
• A cutting method for finding discrete minimax with dropping of cutting planes

Cited in

(5)

• A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems
• One approach to constructing cutting algorithms with dropping of cutting planes
• scientific article; zbMATH DE number 1750489 (Why is no real title available?)
• Constructing mixed algorithms on the basis of some bundle method
• An efficient descent direction method with cutting planes

This page was built for publication: A cutting method and construction of mixed minimization algorithms on its basis

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