A constraint qualification in quasidifferentiable programming
In quasidifferentiable optimization people should be careful in deriving optimality conditions because a quasidifferentiable function has generally a multitude of possible quasidifferentials. A good optimality condition should not depend on a particular choice of quasidifferentials. Demyanov and Rubinov presented a condition which is independent of the particular choice of quasidifferentials but involves the hypothesis of a pair of convex sets being ``in a general position. This paper gives a simple condition implying that the general position hypothesis is satisfied. This condition, a Slater-type condition, is also shown to be a constraint qualification for non-asymptotic Kuhn-Tucker conditions for an inequality-constrained quasidifferentiable program.
- Optimality conditions in quasidifferentiable mathematical programming
- Constraint qualifications in quasidifferentiable optimization
- A note on constraint qualifications in quasidifferentiable programming
- scientific article; zbMATH DE number 1960859
- Generalized K-T conditions and penalty functions for quasidifferentiable programming
- Convex Analysis
- Finite-dimensional optimality conditions: B-gradients
- scientific article; zbMATH DE number 3932969 (Why is no real title available?)
- scientific article; zbMATH DE number 3942323 (Why is no real title available?)
- Necessary Conditions for the Bolza Problem
- Nondifferentiable optimization: motivations and applications. Proceedings of an IIASA (International Institute for Applied Systems Analysis) Workshop on Nondifferentiable Optimization Held at Sopron, Hungary, September 17-22, 1984
- On Shapiro's results in quasidifferential calculus
- Quasidifferential calculus and first-order optimality conditions in nonsmooth optimization
- The differentiability of real functions on normed linear space using generalized subgradients
- The quasidifferential of an optimal value function in nonsmooth programming
- Upper DSL approximates and nonsmooth optimization
- A Farkas lemma for difference sublinear systems and quasidifferentiable programming
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification
- Theorem on an implicit function in quasidifferential calculus
- On optimality conditions and duality results in a class of nonconvex quasidifferentiable optimization problems
- Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
- Constraint qualification in a general class of Lipschitzian mathematical programming problems
- Optimality conditions in quasidifferentiable vector optimization
- Optimality Conditions for Quasi-Differentiable Programs with Application to Two-Level Optimization
- On necessary minimum conditions in quasidifferential calculus: independence of the specific choice of quasidifferentials
- A note on constraint qualifications in quasidifferentiable programming
- On Quasidifferentiable Functions and Non-Differentiable Programming
- scientific article; zbMATH DE number 1159456 (Why is no real title available?)
- scientific article; zbMATH DE number 1960859 (Why is no real title available?)
- Small convex-valued subdifferentials in mathematical programming
- Necessary minimum conditions and steepest descent directions in quasi-differential calculus: independence of the specific forms of quasidifferentials
- Quasi-Multiplier Rules for Quasidifferentiable Extremum Problems
- Fixed point theorem in nonsmooth analysis and its applications
- A new constraint qualification and sharp optimality conditions for nonsmooth mathematical programming problems in terms of quasidifferentials
- Optimality conditions in quasidifferentiable mathematical programming
- Slater Condition for Tangent Derivatives
- On minty variational principle for quasidifferentiable vector optimization problems
- Constraint qualifications in quasidifferentiable optimization
- Optimality conditions for an interval-valued vector problem.
- Nonsmooth quasidifferentiable vector optimization problems with variational inequalities for V-invexity
- On constraint qualifications in nonsmooth optimization.
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
- On constraint qualifications in nonlinear programming
This page was built for publication: A constraint qualification in quasidifferentiable programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3979519)
