Abstract
By an equivalent transformation using the pth 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.
| Original language | English |
|---|---|
| Pages (from-to) | 309-324 |
| Journal | Journal of Optimization Theory and Applications |
| Volume | 85 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - May 1995 |
| Externally published | Yes |
Research Keywords
- duality
- Nonconvex optimization
- nonlinear programming
- primal-dual methods
- saddle points
Fingerprint
Dive into the research topics of 'Zero duality gap for a class of nonconvex optimization problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver