The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming (Q331995)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The exact absolute value penalty function method for identifying strict global minima of order m in nonconvex nonsmooth programming |
scientific article; zbMATH DE number 6644667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming |
scientific article; zbMATH DE number 6644667 |
Statements
The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming (English)
0 references
27 October 2016
0 references
exact \(l_{1}\) penalty function method
0 references
absolute value penalty function
0 references
penalized optimization problem
0 references
locally Lipschitz \((F, \rho) \)-convex function
0 references
generalized Karush-Kuhn-Tucker optimality conditions
0 references
0 references
0 references
0 references
0 references
0 references
0 references
