Lower Complexity Bounds of First-Order Methods for Affinely Constrained Composite Nonconvex Problems.

Saved in:
Bibliographic Details
Title: Lower Complexity Bounds of First-Order Methods for Affinely Constrained Composite Nonconvex Problems.
Authors: Liu, Wei1 (AUTHOR) liuw16@rpi.edu, Lin, Qihang2 (AUTHOR) qihanglin@uiowa.edu, Xu, Yangyang1 (AUTHOR) xuy21@rpi.edu
Source: Mathematics of Operations Research (INFORMS). May2026, Vol. 51 Issue 2, p1659-1682. 24p.
Database: Business Source Ultimate
Be the first to leave a comment!
You must be logged in first