In this paper, we are interested in the development of efficient first-order methods for convex optimization problems in the simultaneous presence of smoothness of the objective function and stochasticity in the first-order information. First, we consider the Stochastic Primal Gradient method, which is nothing else but the Mirror Descent SA method applied to a smooth … Read more
Recently, a worst-case O(1/t) convergence rate was established for the Douglas-Rachford alternating direction method of multipliers in an ergodic sense. This note proposes a novel approach to derive the same convergence rate while in a non-ergodic sense. ArticleDownload View PDF
We propose easily implementable algorithms for minimizing the norm with pseudomonotone variational inequality constraints. This bilevel problem arises in the Tikhonov regularization method for pseudomonone variational inequalities. Since the solution set of the lower variational inequality is not given explicitly, the available methods of mathematical programming and variational inequality can not be applied directly. With … Read more
The contributions of the first half of this thesis are on the computational and algebraic aspects of convexity in polynomial optimization. We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree) is globally convex. This solves … Read more
In this paper, we give two new results on the proximal point algorithm for finding a zero point of any given maximal monotone operator. First, we prove that if the sequence of regularization parameters is non-increasing then so is that of residual norms. Then, we use it to show that the proximal point algorithm can … Read more
This paper is devoted to the so-called pessimistic version of bilevel programming programs. Minimization problems of this type are challenging to handle partly because the corresponding value functions are often merely upper (while not lower) semicontinuous. Employing advanced tools of variational analysis and generalized differentiation, we provide rather general frameworks ensuring the Lipschitz continuity of … Read more
The paper presents a general primal space classification scheme of necessary and sufficient criteria for the error bound property incorporating the existing conditions. Several primal space derivative-like objects – slopes – are used to characterize the error bound property of extended-real-valued functions on metric sapces. CitationPublished in D. Klatte et al. (eds.), Operations Research Proceedings … Read more
In this work, we use the theory of error bounds to study of metric regularity of the sum of two multifunctions, as well as some important properties of variational systems. We use an approach based on the metric regularity of epigraphical multifunctions. Our results subsume some recent results by Durea and Strugariu CitationXLIM (UMR-CNRS 6172) … Read more
The paper concerns the computation of the graphical derivative and the regular (Frechet) coderivative of the solution map to a class of generalized equations, where the multi-valued term amounts to the regular normal cone to a (possibly nonconvex) set given by C2 inequalities. Instead of the Linear Independence qualification condition, standardly used in this context, … Read more
In this paper, we attempt to extend the definition and existing local error bound criteria to vector-valued functions, or more generally, to functions taking values in a normed linear space. Some new primal space derivative-like objects — slopes — are introduced and a classification scheme of error bound criteria is presented. CitationPublished in Vietnam Journal … Read more