scientific article; zbMATH DE number 2196501
Asplund spacecoderivativeconstraint qualificationFréchet normal coneFréchet subdifferentialsubdifferential calculus
Nonsmooth analysis (49J52) Optimality conditions for problems in abstract spaces (49K27) Differentiation theory (Gateaux, Fréchet, etc.) on manifolds (58C20) Variational principles in infinite-dimensional spaces (58E30) Nonconvex programming, global optimization (90C26) Programming in abstract spaces (90C48)
The author provides necessary optimality conditions for the solutions of general optimization problems with geometric and operator constraints according to \[ f(x)\Rightarrow\min,\quad\text{s.t. }G(x)\in B,\;x\in A, \] where \(f: X\to\mathbb{R}\) is a locally Lipschitz function on the Asplund space \(X\), \(G: X\to Y\) is a continuous function between the Asplund spaces \(X\) and \(Y\), \(A\subset X\) and \(B\subset Y\) are nonempty closed sets. The approach bases on calculus rules for the Fréchet subdifferential mapping \(\partial f\) and the coderivative \(D^*G\) and especially on the representation of the Fréchet normal cone \(N_C\) to the feasible set \(C=\{x\in A\mid G(x)\in B\}\) by means of the normal cones to the sets \(A\) and \(B\). In the first main theorem it is shown that -- assuming a generalized constraint qualification -- for a local solution \(\overline x\in C\) there exist \(z^*\in N_A(\overline x)\) and \(y^*\in N_B(G(\overline x))\) such that \[ 0\in\partial f(\overline x)+ D^* G(\overline x)(y^*)+ z^*. \] A similar result is formulated for a suboptimal solution of the optimization problem using a known variational principle of Mordukhovich and Wang. For the entire collection see [Zbl 1063.00012].
- Optimization under generalized equation constraints in Asplund spaces
- Necessary optimality conditions for minimax programming problems with mathematical constraints
- Necessary optimality conditions for nonsmooth problems with operator constraints
- Necessary conditions for constrained optimization problems with semicontinuous and continuous data
- General constraint qualifications in nondifferentiable programming
- Necessary conditions for a mathematical programming problem with set and cone constraints
- On Minimax Fractional Semi-Infinite Programming Problems with Applications
- Optimization under generalized equation constraints in Asplund spaces
- A nondegenerate fuzzy optimality condition for constrained optimization problems without qualification conditions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465348)
