A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems

DOI10.1134/S1995080218060197zbMath1401.90161OpenAlexW2885385069WikidataQ129424806 ScholiaQ129424806MaRDI QIDQ1990958

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

Publication date: 29 October 2018

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

Full work available at URL: https://doi.org/10.1134/s1995080218060197

zbMATH Keywords

convergencecutting planeepigraphapproximating setconditional minimizationsequence of approximations

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05)

Related Items (2)

Constructing Mixed Algorithms on the Basis of Some Bundle Method ⋮ A two-stage cutting-plane method for conditional minimizing function

Cites Work

• Unnamed Item
• Unnamed Item
• One approach to constructing cutting algorithms with dropping of cutting planes
• On several algorithms of immersion - cutoff for the problem of mathematical programming
• Introductory lectures on convex optimization. A basic course.
• A cutting method for finding discrete minimax with dropping of cutting planes
• A minimization method with approximation of feasible set and epigraph of objective function
• The Cutting-Plane Method for Solving Convex Programs
• Cutting methods in E n+ 1 for global optimization of a class of functions

This page was built for publication: A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems