A minimization method with approximation of feasible set and epigraph of objective function

DOI10.3103/S1066369X16110098zbMath1375.90237OpenAlexW2537787152MaRDI QIDQ2363374

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

Publication date: 19 July 2017

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x16110098

zbMATH Keywords

convergenceconvex programmingcutting planecutting-plane methodsapproximating setsequence of approximations

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (2)

One variant of the objective function parameterization method and its implementation ⋮ A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems

Cites Work

• Unnamed Item
• 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
• 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 minimization method with approximation of feasible set and epigraph of objective function