An approximate method for solving the convex programming problem
1992
We consider an iterative process for maximization of a convex nondifferentiable functional in a real Hilbert space. Two-sided bounds on the optimal functional value are derived. Stability of the approximate solutions is considered. Convergence of the proposed iterative process is proved.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
1
References
0
Citations
NaN
KQI