Results 141 to 150 of about 1,995,695 (219)
Some of the next articles are maybe not open access.
Infinite Alternative Theorems and Nonsmooth Constraint Qualification Conditions
Set-Valued and Variational Analysis, 2012In this paper, the authors obtain some infinite alternative theorems in locally convex spaces. Using Clarke's generalized subdifferential and Mordukhovich's limiting subdifferential, they introduce nonsmooth versions of some constraint qualification conditions in optimization theory, in the absence of differentiability, in Banach and Asplund spaces and
Asadi, Mohammad B. +1 more
openaire +3 more sources
A constraint qualification in quasidifferentiable programming
Optimization, 1991One goal in quasid if Terentiable optimization is the development of optimality conditions whose hypotheses are independent of the particular choice of quasidifferentials. One such hypothesis, introduced by Demyanov and Rubinov, involves the concept of a pair of convex sets being “in a general position”.
D. Ward
openaire +2 more sources
Optimization, 2023
We discuss the (first- and second-order) optimality conditions for nonlinear programming under the relaxed constant rank constraint qualification (RCRCQ).
A. Ribeiro, M. Sachine
semanticscholar +1 more source
We discuss the (first- and second-order) optimality conditions for nonlinear programming under the relaxed constant rank constraint qualification (RCRCQ).
A. Ribeiro, M. Sachine
semanticscholar +1 more source
Constraint Qualifications Revisited
Management Science, 1972In this study we investigate the constraint qualifications for the Kuhn-Tucker conditions to hold for an inequality-constrained nonlinear programming problem. We present the qualifications in a consistent manner so that the interrelationships between them are highlighted. This gives rise naturally to two types of constraint qualifications, and it will
M. S. Bazaraa, J. J. Goode, C. M. Shetty
openaire +2 more sources
Optimization, 2020
In this paper, a Mangasarian–Fromovitz-type regularity condition is presented with the purpose of obtaining first order necessary optimality conditions for continuous-time nonlinear programming problems with both equality and inequality constraints.
Moisés Rodrigues Cirilo do Monte +1 more
semanticscholar +1 more source
In this paper, a Mangasarian–Fromovitz-type regularity condition is presented with the purpose of obtaining first order necessary optimality conditions for continuous-time nonlinear programming problems with both equality and inequality constraints.
Moisés Rodrigues Cirilo do Monte +1 more
semanticscholar +1 more source
SIAM Journal on Optimization, 2019
In the present paper, we prove that the augmented Lagrangian method converges to KKT points under the quasi-normality constraint qualification, which is associated with the external penalty theory....
R. Andreani +3 more
semanticscholar +1 more source
In the present paper, we prove that the augmented Lagrangian method converges to KKT points under the quasi-normality constraint qualification, which is associated with the external penalty theory....
R. Andreani +3 more
semanticscholar +1 more source
Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
Optim. Methods Softw., 2019This work concerns the study of a constraint qualification for non-smooth DC-constrained optimization problems, as well as the design and convergence analysis of minimizing algorithms to address the task of computing a stationary/critical point for ...
W. Ackooij, W. Oliveira
semanticscholar +1 more source
Constraint qualifications in maximization problems
Naval Research Logistics Quarterly, 1961AbstractMany problems arising in logistics and in the application of mathematics to industrial planning are in the form of constrained maximizations with nonlinear maximands or constraint functions or both. Thus a depot facing random demands for several items may wish to place orders for each in such a way as to maximize the expected number of demands ...
Arrow, K. J. +2 more
openaire +2 more sources
Constraint qualifications in the invex case
Journal of Information and Optimization Sciences, 1998Abstract The purposes of the present paper are: (1) to weaken certain constraint qualifications (CQ’s) for a nonlinear programming problem by means of invexity; (2) to study the relationships among the various CQ’s in the case of a closed set constraint; (3) to give a sufficient condition for the equivalence between the Kuhn-Tucker CQ and the Abadie CQ.
GIORGI G., GUERRAGGIO, ANGELO
openaire +2 more sources
Constraint Qualifications for Nonsmooth Mathematical Programs with Equilibrium Constraints
Set-Valued and Variational Analysis, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Movahedian, N., Nobakhtian, S.
openaire +2 more sources