A General Approximation Method for a Kind of Convex Optimization Problems in Hilbert Spaces
The constrained convex minimization problem is to find a point x∗ with the property that x∗∈C, and h(x∗)=min h(x), ∀x∈C, where C is a nonempty, closed, and convex subset of a real Hilbert space H, h(x) is a real-valued convex function, and h(x) is not Fréchet differentiable, but lower semicontinuou...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/156073 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|