Results 1 to 10 of about 53 (53)
Relations between Abs-Normal NLPs and MPCCs. Part 1: Strong Constraint Qualifications [PDF]
Journal of Nonsmooth Analysis and Optimization, 2021 This work is part of an ongoing effort of comparing non-smooth optimization problems in abs-normal form to MPCCs. We study the general abs-normal NLP with equality and inequality constraints in relation to an equivalent MPCC reformulation.
Lisa C. Hegerhorst-Schultchen +2 more
doaj +1 more source
Relations between Abs-Normal NLPs and MPCCs. Part 2: Weak Constraint Qualifications [PDF]
Journal of Nonsmooth Analysis and Optimization, 2021 This work continues an ongoing effort to compare non-smooth optimization problems in abs-normal form to Mathematical Programs with Complementarity Constraints (MPCCs).
Lisa C. Hegerhorst-Schultchen +2 more
doaj +1 more source
Infant Mental Health Journal: Infancy and Early Childhood, Volume 42, Issue 1, Page 21-34, January/February 2021., 2021 ABSTRACT Parental reflective functioning (PRF) is an important predictor of infant attachment, and interventions that target parent–infant/toddler dyads who are experiencing significant problems have the potential to improve PRF. A range of dyadic interventions have been developed over the past two decades, some of which explicitly target PRF as part ...
Jane Barlow +2 more
wiley +1 more source
Nondiffusive variational problems with distributional and weak gradient constraints
Advances in Nonlinear Analysis, 2022 In this article, we consider nondiffusive variational problems with mixed boundary conditions and (distributional and weak) gradient constraints. The upper bound in the constraint is either a function or a Borel measure, leading to the state space being ...
Antil Harbir +3 more
doaj +1 more source
Presolving linear bilevel optimization problems
EURO Journal on Computational Optimization, 2021 Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization.
Thomas Kleinert +3 more
doaj +1 more source
Characterizations of the Solution Sets of Generalized Convex Fuzzy Optimization Problem
Open Mathematics, 2019 This paper provides some new characterizations of the solution sets for non-differentiable generalized convex fuzzy optimization problem. Firstly, we introduce some new generalized convex fuzzy functions and discuss the relationships among them. Secondly,
Chen Wang, Zhou Zhiang
doaj +1 more source
Optimality and duality in set-valued optimization utilizing limit sets
Open Mathematics, 2018 This paper deals with optimality conditions and duality theory for vector optimization involving non-convex set-valued maps. Firstly, under the assumption of nearly cone-subconvexlike property for set-valued maps, the necessary and sufficient optimality ...
Kong Xiangyu, Zhang Yinfeng, Yu GuoLin
doaj +1 more source
Symmetric duality for a class of multiobjective programming
International Journal of Mathematics and Mathematical Sciences, Volume 24, Issue 9, Page 617-625, 2000., 2000 We formulate a pair of symmetric dual nondifferentiable multiobjective programming and establish appropriate duality theorems. We also show that differentiable and nondifferentiable analogues of several pairs of symmetric dual problems can be obtained as special cases of our general symmetric programs.
Xinmin Yang, Shouyang Wang, Duan Li
wiley +1 more source
EURO Journal on Computational Optimization, 2015 Quantified linear programs (QLPs) are linear programs with variables being either existentially or universally quantified. QLPs are convex multistage decision problems on the one side, and two-person zero-sum games between an existential and a universal ...
Ulf Lorenz, Jan Wolf
doaj +1 more source
Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
Open Mathematics, 2019 A new class of generalized convex set-valued maps termed relatively solid generalized cone-subconvexlike maps is introduced in real linear spaces not equipped with any topology.
Liang Hongwei, Wan Zhongping
doaj +1 more source