Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization.

Saved in:
Bibliographic Details
Title: Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization.
Authors: Lin, Qihang1, qihang-lin@uiowa.edu, Ma, Runchao1, Xu, Yangyang2
Source: Computational Optimization & Applications; May2022, Vol. 82 Issue 1, p175-224, 50p
Database: Applied Science & Technology Source
Full text is not displayed to guests.
Be the first to leave a comment!
You must be logged in first