Abstract
A class of general transformation methods are proposed to convert a nonconvex optimization problem to another equivalent problem. It is shown that under certain assumptions the existence of a local saddle point or local convexity of the Lagrangian function of the equivalent problem (EP) can be guaranteed. Numerical experiments are given to demonstrate the main results geometrically.
| Original language | English |
|---|---|
| Pages (from-to) | 405-419 |
| Number of pages | 15 |
| Journal | Journal of Global Optimization |
| Volume | 38 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Jul 2007 |
| Externally published | Yes |
Keywords
- Convexification
- Local convexity
- Local saddle point
- Nonconvex optimization
Fingerprint
Dive into the research topics of 'Local saddle point and a class of convexification methods for nonconvex optimization problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver