On Constraint qualifications of a nonconvex inequality
Optimization Letters, 2017 In this paper, we study constraint qualifications for the nonconvex inequality defined by a proper lower semicontinuous function. These constraint qualifications involve the generalized construction of normal cones and subdifferentials. Several conditions for these constraint qualifications are also provided therein.
Zhou Wei, Jen-Chih Yao
openaire +4 more sources
Min–sup-type zero duality gap properties for DC composite optimization problem
Journal of Inequalities and Applications, 2019 In this paper, we present min–sup-type zero duality gap properties for DC composite optimization problem with conic constraints. Using properties of the subdifferentials of involved functions, we introduce some new constraint qualifications.
Li Ping Tian, Dong Hui Fang
doaj +1 more source
Guignard Qualifications and Stationary Conditions for Mathematical Programming with Nonsmooth Switching Constraints [PDF]
Control and Optimization in Applied Mathematics, 2021 In this paper, some constraint qualifications of the Guignard type are defined for optimization problems with continuously differentiable objective functions and locally Lipschitz switching constraints.
Fatemeh Gorgini Shabankareh +3 more
doaj +1 more source
On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints [PDF]
Yugoslav Journal of Operations Research, 2019 In this paper, we considered the mathematical programs with vanishing constraints or MPVC. We proved that an MPVC-tailored penalty function, introduced in [5], is still exact under a very weak and new constraint qualification.
Nath Triloki, Khare Abeka
doaj +1 more source
On Constraint Qualifications and Optimality Conditions in Nonsmooth Semi-infinite Optimization [PDF]
Control and Optimization in Applied MathematicsThe primary objective of this paper is to enhance several well-known geometric constraint qualifications and necessary optimality conditions for nonsmooth semi-infinite optimization problems (SIPs).
Atefeh Hassani Bafrani
doaj +1 more source
Strong and Total Lagrange Dualities for Quasiconvex Programming
Journal of Applied Mathematics, 2014 We consider the strong and total Lagrange dualities for infinite quasiconvex optimization problems. By using the epigraphs of the z-quasi-conjugates and the Greenberg-Pierskalla subdifferential of these functions, we introduce some new constraint ...
Donghui Fang, XianFa Luo, Xianyun Wang
doaj +1 more source
Inertial Extragradient Methods for Solving Split Equilibrium Problems
Mathematics, 2021 This paper presents two inertial extragradient algorithms for finding a solution of split pseudomonotone equilibrium problems in the setting of real Hilbert spaces. The weak and strong convergence theorems of the introduced algorithms are presented under
Suthep Suantai +2 more
doaj +1 more source
On implicit variables in optimization theory [PDF]
Journal of Nonsmooth Analysis and Optimization, 2021 Implicit variables of a mathematical program are variables which do not need to be optimized but are used to model feasibility conditions. They frequently appear in several different problem classes of optimization theory comprising bilevel programming ...
Matúš Benko, Patrick Mehlitz
doaj +1 more source
Linear semidefinite programming problems: regularisation and strong dual formulations
Журнал Белорусского государственного университета: Математика, информатика, 2020 Regularisation consists in reducing a given optimisation problem to an equivalent form where certain regularity conditions, which guarantee the strong duality, are fulfilled.
Olga I. Kostyukova +1 more
doaj +1 more source
Constraint qualification failure in action
Operations Research Letters, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hassan L. Hijazi, Leo Liberti
openaire +3 more sources