Abstract
The article considers the variable-metric continuous proximal method for the convex programming problem. The convergence of the method is proved. The regularized version of the method is proposed for the case where the objective function and the feasible set are defined inexactly. A regularizing operator is constructed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
