Results 21 to 30 of about 564,271 (287)
This paper deals with robust quasi approximate optimal solutions for a nonsmooth semi-infinite optimization problems with uncertainty data. By virtue of the epigraphs of the conjugates of the constraint functions, we first introduce a robust type closed ...
Xiangkai Sun, Hongyong Fu, Jing Zeng
doaj +1 more source
We take up a nonsmooth multiobjective optimization problem with tangentially convex objective and constraint functions. In employing a suitable constraint qualification, we formulate both necessary and sufficient optimality conditions for (local) quasi ...
Mohsine Jennane +3 more
doaj +1 more source
Constant-Rank Condition and Second-Order Constraint Qualification [PDF]
The constant-rank condition for feasible points of nonlinear programming problems was defined by Janin (Math. Program. Study 21:127-138, 1984). In that paper, the author proved that the constant-rank condition is a first-order constraint qualification ...
Echagüe, C. E. +2 more
core +2 more sources
Mordukhovich Normal Cone of Optimization Problems with Switching Constraints [PDF]
This paper examines normal cones of the feasible set for mathematical programming problems with switching constraints (MPSC). Functions involved are assumed to be continuously differentiable.
Sharifeh Rezagholi +1 more
doaj +1 more source
Optimality and Duality for DC Programming with DC Inequality and DC Equality Constraints
In this paper, a class of nondifferentiable DC programming with DC inequality and DC equality constraints are considered. Firstly, in terms of this special nondifferentiable DC constraint system, an appropriate relaxed constant rank constraint ...
Yingrang Xu, Shengjie Li
doaj +1 more source
This paper is devoted to the study of optimality conditions for strict minimizers of higher-order for a non-smooth semi-infinite multi-objective optimization problem.
Guolin Yu
doaj +1 more source
Asymptotic stationarity and regularity for nonsmooth optimization problems [PDF]
Based on the tools of limiting variational analysis, we derive a sequential necessary optimality condition for nonsmooth mathematical programs which holds without any additional assumptions. In order to ensure that stationary points in this new sense are
Patrick Mehlitz
doaj +1 more source
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
On Mond–Weir-Type Robust Duality for a Class of Uncertain Fractional Optimization Problems
This article is focused on the investigation of Mond–Weir-type robust duality for a class of semi-infinite multi-objective fractional optimization with uncertainty in the constraint functions.
Xiaole Guo
doaj +1 more source
Relations between Abs-Normal NLPs and MPCCs. Part 2: Weak Constraint Qualifications [PDF]
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

