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

DOI10.1134/S1995080218060197zbMATH Open1401.90161OpenAlexW2885385069WikidataQ129424806 ScholiaQ129424806MaRDI QIDQ1990958FDOQ1990958

Authors: 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

Recommendations

• A minimization method with approximation of feasible set and epigraph of objective function
• A cutting method with updating approximating sets and its combination with other algorithms
• 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 and construction of mixed minimization algorithms on its basis

zbMATH Keywords

convergenceepigraphapproximating setconditional minimizationcutting planesequence of approximations

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• A cutting plane algorithm with an approximation of an epigraph
• 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
• A cutting method with updating approximating sets and its combination with other algorithms
• A two-stage cutting-plane method for conditional minimizing function
• Constructing mixed algorithms on the basis of some bundle method
• A cutting method and construction of mixed minimization algorithms on its basis
• A cutting-plane method without inclusions of approximating sets for conditional minimization
• One approach to constructing cutting algorithms with dropping of 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 approximation of a constraint region and an epigraph for solving conditional minimization problems

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