2 citations · 2 across the 5 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2021
A Fully Adaptive Steepest Descent Method
Z. R. Gabidullina
For solving pseudo-convex global optimization problems, we present a novel fully adaptive steepest descent method (or ASDM) without any hard-to-estimate parameters. For the step-si…
math.OC2019★ 2 cited
The Minkowski Difference for Convex Polyhedra and Some its Applications
Z. R. Gabidullina
The aim of the paper is to develop a unified algebraical approach to representing the Minkowski difference for convex polyhedra. Namely, there is proposed an exact analytical formu…