2010/07/11 by Radu Ioan Boţ, Bot, Radu Ioan, Ernö Robert Csetnek +1
Computer Science · Engineering · Mathematics · #49N15 #90C25 #90C31 #Advanced Optimization Algorithms Research #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Variational Analysis #Stability and Control of Uncertain Systems
paper · pdf · doi:10.48550/arxiv.1007.1776
openalex publication_date 2010/07/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The aim of this paper is to implement some new techniques, based on conjugate duality in convex optimization, for proving the existence of global error bounds for convex inequality systems. We deal first of all with systems described via one convex inequality and extend the achieved results, by making use of a celebrated scalarization function, to convex inequality systems expressed by means of a general vector function. We also propose a second approach for guaranteeing the existence of global error bounds of the latter, which meanwhile sharpens the classical result of Robinson.