A minimization method with approximation of feasible set and epigraph of objective function
From MaRDI portal
Publication:2363374
DOI10.3103/S1066369X16110098zbMATH Open1375.90237OpenAlexW2537787152MaRDI QIDQ2363374FDOQ2363374
Authors: 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
Recommendations
- A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems
- 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 with updating of approximating sets and estimates of the solution accuracy
- A cutting-plane method without inclusions of approximating sets for conditional minimization
convergenceconvex programmingapproximating setcutting planecutting-plane methodssequence of approximations
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
- A cutting-plane method with updating of approximating sets and estimates of the solution accuracy
- Title not available (Why is that?)
- 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
Cited In (8)
- 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
- One variant of the objective function parameterization method and its implementation
- A cutting method with updating approximating sets and its combination with other algorithms
- One approach to constructing cutting algorithms with dropping of cutting planes
- A base reduction method for convex programming
- A cutting-plane method with updating of approximating sets and estimates of the solution accuracy
This page was built for publication: A minimization method with approximation of feasible set and epigraph of objective function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363374)
