A new projection method for finding the closest point in the intersection of convex sets [PDF]
, 2017 In this paper we present a new iterative projection method for finding the closest point in the intersection of convex sets to any arbitrary point in a Hilbert space.
Artacho, Francisco J. Aragón +1 more
core +3 more sources
Robust Nonsmooth Interval-Valued Optimization Problems Involving Uncertainty Constraints
Mathematics, 2022 In this paper, Karush-Kuhn-Tucker type robust necessary optimality conditions for a robust nonsmooth interval-valued optimization problem (UCIVOP) are formulated using the concept of LU-optimal solution and the generalized robust Slater constraint ...
Rekha R. Jaichander +3 more
doaj +1 more source
A Declarative Semantics for CLP with Qualification and Proximity [PDF]
, 2010 Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications.
Rodríguez-Artalejo, Mario +1 more
core +1 more source
Advances in Electrical and Electronic Engineering, 2017 The classical convergence theory of the augmented Lagrangian method has been developed under the assumption that the solutions satisfy a constraint qualification.
Zdenek Dostal, Petr Beremlijski
doaj +1 more source
Two New Weak Constraint Qualifications and Applications [PDF]
SIAM Journal on Optimization, 2012 We present two new constraint qualifications (CQs) that are weaker than the recently introduced relaxed constant positive linear dependence (RCPLD) CQ. RCPLD is based on the assumption that many subsets of the gradients of the active constraints preserve positive linear dependence locally.
Andreani, Roberto +3 more
openaire +3 more sources
Second-Order Karush-Kuhn-Tucker Optimality Conditions for Vector Problems with Continuously Differentiable Data and Second-Order Constraint Qualifications [PDF]
, 2014 Some necessary and sufficient optimality conditions for inequality constrained problems with continuously differentiable data were obtained in the papers [I. Ginchev and V.I. Ivanov, Second-order optimality conditions for problems with C$\sp{1}$ data, J.
Ivanov, Vsevolod I.
core +1 more source
Stable Zero Lagrange Duality for DC Conic Programming
Journal of Applied Mathematics, 2012 We consider the problems of minimizing a DC function under a cone-convex constraint and a set constraint. By using the infimal convolution of the conjugate functions, we present a new constraint qualification which completely characterizes the Farkas ...
D. H. Fang
doaj +1 more source
Exact penalization, level function method, and modified cutting-plane method for stochastic programs with second order stochastic dominance constraints [PDF]
, 2013 Level function methods and cutting plane methods have been recently proposed to solve stochastic programs with stochastic second order dominance (SSD) constraints.
Meskarian, R., Sun, H., Wang, Y., Xu, H.
core +2 more sources
, 2020 This study investigates the factors influencing accounting students’ intention to pursue a professional qualification upon graduation. By employing the Belief, Preference and Constraint (BPC) Model from the Behavioral Decision Theory (BDT), the study ...
Hanimastura Hashim, E. Ghani
semanticscholar +1 more source
Inexact Restoration Methods for Semivectorial Bilevel Programming Problem on Riemannian Manifolds
Axioms, 2022 For a better understanding of the bilevel programming on Riemannian manifolds, a semivectorial bilevel programming scheme is proposed in this paper. The semivectorial bilevel programming is firstly transformed into a single-level programming problem by ...
Jiagen Liao, Zhongping Wan
doaj +1 more source