The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming (Q331995): Difference between revisions
From MaRDI portal
Latest revision as of 19:28, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming |
scientific article |
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
