Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations

From MaRDI portal
Publication:5231367

DOI10.1080/02331934.2019.1597357zbMath1419.90086arXiv1602.06794OpenAlexW2963730749WikidataQ128152620 ScholiaQ128152620MaRDI QIDQ5231367

No author found.

Publication date: 26 August 2019

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.06794




Related Items (1)



Cites Work


This page was built for publication: Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations