Abstract
In this paper we propose an inexact proximal point method to solve constrained minimization problems with locally Lipschitz quasiconvex objective functions. Assuming that the function is also bounded from below, lower semicontinuous and using proximal distances, we show that the sequence generated for the method converges to a stationary point of the problem.
| Original language | English |
|---|---|
| Pages (from-to) | 721-729 |
| Number of pages | 9 |
| Journal | European Journal of Operational Research |
| Volume | 246 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Nov 2015 |
| Externally published | Yes |
Keywords
- Computing science
- Global optimization
- Nonlinear programming
- Proximal point methods
- Quasiconvex minimization
Fingerprint
Dive into the research topics of 'An inexact proximal method for quasiconvex minimization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver