Results 11 to 20 of about 2,261 (257)

Constraint qualifications in input optimisation [PDF]

The Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1989
AbstractWe introduce assumptions in input optimisation that simplify the necessary conditions for an optimal input. These assumptions, in the context of nonlinear programming, give rise to conceptually new kinds of constraint qualifications.
van Rooyen, M., Sears, M., Zlobec, S.
openaire   +2 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

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, Narin Petrot, Manatchanok Khonchaliew   +2 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

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

The Lagrangian, constraint qualifications and economics

Mathematical Methods of Operations Research, 2022
AbstractConsidering constrained choice, practitioners and theorists frequently invoke a Lagrangian to generate optimality conditions. Regular use of that vehicle requires, however, some constraintqualification. Yet many economists go easy on the mathematics of that issue. Conversely, few mathematicians elaborate on the economics of the context. Thereby
Sjur D. Flåm, Jan-J. Rückmann
openaire   +3 more sources

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, Tatiana V. Tchemisova   +1 more
doaj   +1 more source

Lagrange-type duality in DC programming problems with equivalent DC inequalities

Journal of Inequalities and Applications, 2016
In this paper, we provide Lagrange-type duality theorems for mathematical programming problems with DC objective and constraint functions. The class of problems to which Lagrange-type duality theorems can be applied is broader than the class in the ...
Ryohei Harada, Daishi Kuroiwa
doaj   +1 more source

Constraint Qualifications and Optimality Conditions for Multiobjective Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds

Mathematics
In this paper, we investigate constraint qualifications and optimality conditions for multiobjective mathematical programming problems with vanishing constraints (MOMPVC) on Hadamard manifolds.
Balendu Bhooshan Upadhyay, Arnav Ghosh, Savin Treanţă, Jen-Chih Yao   +3 more
doaj   +1 more source

RDFS_(c) Schema Inconsistency Checking Based on a Key Instance and Its Query Rewriting

IEEE Access, 2023
The introduction of a constraint mechanism to the resource description framework schema (RDFS) poses challenges for keeping RDFS ontologies consistent, particularly in the presence of reasoning rules (RRs).
Xiaofei Zhao, Fanzhang Li, Hongji Yang
doaj   +1 more source