Penalty—proximal methods in convex programming
1987
An implementable algorithm for constrained nonsmooth convex programs is given. This algorithm combines exterior penalty methods with the proximal method. In the case of a linear program, the convergence is finite.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
14
References
45
Citations
NaN
KQI