Crossmark

Two New Customized Proximal Point Algorithms Without Relaxation for Linearly Constrained Convex Optimization

Published Online: 2019-10-23

Published Print: 2020-06

Authors

Jiang, Binqian

Peng, Zheng https://orcid.org/0000-0003-2932-4765
Deng, Kangkang
Funding

Funding for this research was provided by:

National Natural Science Foundation of China (11571074)

National Natural Science Foundation of China (11726505)
License Information

Text and Data Mining valid from 2019-10-23

Version of Record valid from 2019-10-23
More Information

Article History

Received: 4 May 2018

Revised: 31 August 2019

Accepted: 14 September 2019

First Online: 23 October 2019

Document is current