Nondifferentiable optimization by smooth approximations (Q3719359)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3949127
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nondifferentiable optimization by smooth approximations |
scientific article; zbMATH DE number 3949127 |
Statements
Nondifferentiable optimization by smooth approximations (English)
0 references
1986
0 references
nonsmooth constraint minimization problem
0 references
locally Lipschitz functions
0 references
Necessary Lagrangian conditions
0 references
semiinfinite programming
0 references
continuous programming
0 references
optimal control
0 references
duality
0 references
generalized gradients
0 references
0.9677459
0 references
0.9577199
0 references
0.94935113
0 references
0.9285772
0 references
The following nonsmooth constraint minimization problem is considered: Minimize f(x) subject to \(x\in X_ 0\), -g(x)\(\in S\), \(h(x)=0\), where \(X_ 0\) is an open subset of \(R^ n\), \(f: X_ 0\to R\), \(g: K_ 0\to R^ m\), \(h: X_ 0\to R^ r\) are locally Lipschitz functions, not necessarily Fréchet-differentiable, S is an arbitrary closed convex cone in \(R^ m\), int \(S\neq \emptyset\). Necessary Lagrangian conditions for this problem are obtained via a sequence of smooth local approximations to the problem. The approach is applied to finite dimensional problems with convex cones, semiinfinite programming problems, continuous programming problems, and optimal control. A duality theorem is obtained, in which the usual convexity hypotheses are weakened to a generalized invex condition using generalized gradients.
0 references