Zero duality gap for a class of nonconvex optimization problems (Q1897453)
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 790568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Zero duality gap for a class of nonconvex optimization problems |
scientific article; zbMATH DE number 790568 |
Statements
Zero duality gap for a class of nonconvex optimization problems (English)
0 references
27 August 1995
0 references
By an equivalent transformation using the \(p\)th power of the objective function and the constraint, a saddle point can be generated for a general class of nonconvex optimization problems. Zero duality gap is thus guaranteed when the primal-dual method is applied to the constructed equivalent form.
0 references
saddle points
0 references
nonconvex optimization
0 references
primal-dual method
0 references
0 references
0.8531064391136169
0 references
0.8168544769287109
0 references
0.8138860464096069
0 references
0.8129902482032776
0 references
