TD Chuong - SIAM Journal on Optimization, 2020 - SIAM
In this paper, we employ advanced techniques of variational analysis and generalized differentiation to examine robust optimality conditions and robust duality for an uncertain …
This book provides a novel approach to convex analysis and convex optimization, based on subdifferential calculus of pointwise suprema of convex functions. The main goal in writing …
The paper is devoted to the subdifferential study and applications of the supremum of uniformly Lipschitzian functions over arbitrary index sets with no topology. Based on …
We discuss constraint qualifications in Karush–Kuhn–Tucker multiplier rules in nonsmooth semi-infinite multiobjective programming. A version of the Manganarian–Fromovitz …
MA Goberna, N Kanzi - Mathematical Programming, 2017 - Springer
The purpose of this paper is to characterize the weak efficient solutions, the efficient solutions, and the isolated efficient solutions of a given vector optimization problem with …
N Kanzi - SIAM Journal on Optimization, 2014 - SIAM
In this paper, we present several constraint qualifications, and we show that conditions guarantee the nonvacuity of the Karush--Kuhn--Tucker multipliers set for nonsmooth semi …
The main aim of this paper is to study strong Karush–Kuhn–Tucker (KKT) optimality conditions for nonsmooth multiobjective semi-infinite programming (MSIP) problems. By …
This paper is devoted to the study of general nonsmooth problems of cone-constrained optimization (or conic programming) important for various aspects of optimization theory and …
In the present paper, we analyze a class of convex semi-infinite programming problems with arbitrary index sets defined by a finite number of nonlinear inequalities. The analysis is …