Keywords: مدارک محدودیت; Convex programming; Nonconvex constraints; Constraint qualifications; Best approximation; Necessary and sufficient optimality conditions;
مقالات ISI مدارک محدودیت (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: مدارک محدودیت; Weak efficient solutions; Global efficient solutions; Efficient solutions; Clarke subdifferentials; Michel-Penot subdifferentials; Constraint qualifications;
Keywords: مدارک محدودیت; Multiobjective optimization; Convex optimization; Semi-infinite optimization; Constraint qualifications
Study of M-stationarity and strong stationarity for a class of SMPCC problems via SAA Method
Keywords: مدارک محدودیت; Stochastic mathematical programming problem with complementarity constraints (SMPCC); Constraint qualifications; Strong and M-stationarity; Sample average approximation (SAA) method;
Boundedness of certain sets of Lagrange multipliers in vector optimization
Keywords: مدارک محدودیت; Nonsmooth optimization; MP-subdifferential; Constraint qualifications; Optimality conditions; 49J52; 49K05; 90C29;
Constraint qualifications in linear vector semi-infinite optimization
Keywords: مدارک محدودیت; Multiple objective programming; Linear vector semi-infinite optimization; Constraint qualifications; Cone conditions; KKT conditions
Characterizations of εε-duality gap statements for composed optimization problems
Keywords: مدارک محدودیت; 49N15; 90C25; 90C34Conjugate functions; εε-duality gap; Constraint qualifications; Fenchel–Lagrange dual
On constraint qualifications in terms of approximate Jacobians for nonsmooth continuous optimization problems
Keywords: مدارک محدودیت; Constraint qualifications; Nonsmooth continuous optimization problems; Approximate Jacobians; Calmness
Constraint qualifications for constrained Lipschitz optimization problems and applications to a MPCC
Keywords: مدارک محدودیت; Constrained Lipschitz optimization; Constraint qualifications; Calmness; Mathematical program with complementarity constraints
New strong duality results for convex programs with separable constraints
Keywords: مدارک محدودیت; Strong duality; Separable convex constraints; Constraint qualifications; Convex programming;
Generalized convexity and efficiency for non-regular multiobjective programming problems with inequality-type constraints
Keywords: مدارک محدودیت; Generalized convexity; Non-regularity; Constraint qualifications; Optimality conditions
On necessary conditions for a class of nondifferentiable minimax fractional programming
Keywords: مدارک محدودیت; 90C32; Minimax fractional problems; Necessary conditions; Constraint qualifications;
New regularity conditions for strong and total Fenchel–Lagrange duality in infinite dimensional spaces
Keywords: مدارک محدودیت; 49N15; 90C25; 90C34Conjugate functions; Fenchel–Lagrange dual; Constraint qualifications; (Locally) Farkas–Minkowski condition; Stable strong duality
Constraint qualification in a general class of nondifferentiable mathematical programming problems
Keywords: مدارک محدودیت; Generalized gradient; Constraint qualifications; Nondifferentiable problems; Fractional programming; Necessary optimality conditions
Necessary and sufficient conditions for stable conjugate duality
Keywords: مدارک محدودیت; 90C25; 49J52; 49J53; 49J35; 65K10Conjugate duality; Constraint qualifications; Convex programming; Polyhedral functions; Sublinear functions
An alternative formulation for a new closed cone constraint qualification
Keywords: مدارک محدودیت; 46N10; 42A50; 90C25Convex optimization; Constraint qualifications; Conjugate duality; Weak and strong duality
Constraint qualifications in a class of nondifferentiable mathematical programming problems
Keywords: مدارک محدودیت; Necessary conditions; Nondifferentiable problems; Constraint qualifications;
Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
Keywords: مدارک محدودیت; Mathematical program with equilibrium constraints; Necessary optimality conditions; Sufficient optimality conditions; Constraint qualifications;