A cutting method for finding discrete minimax with dropping of cutting planes

DOI10.1134/S1995080214020127zbMath1312.65099OpenAlexW2073509543MaRDI QIDQ2263093

Igor' Yaroslavich Zabotin, Rashid Samatovich Yarullin

Publication date: 17 March 2015

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

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

zbMATH Keywords

algorithmconvergencecutting planeapproximating setconditional minimizationsequence of approximationsdiscrete maximum function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (3)

A minimization method with approximation of feasible set and epigraph of objective function ⋮ 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

• New variants of bundle methods
• Unnamed Item

This page was built for publication: A cutting method for finding discrete minimax with dropping of cutting planes