skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Thursday, October 10 until 2:00 AM ET on Friday, October 11 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the NSF-PAR

  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Award ID contains: 2023032

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ( , SIAM Journal on Optimization)
    We provide sufficient conditions for instability of the subgradient method with constant step size around a local minimum of a locally Lipschitz semialgebraic function. They are satisfied by several spurious local minima arising in robust principal component analysis and neural networks. 
    more » « less
    Free, publicly-accessible full text available March 31, 2025
  2. ; ( , SIAM Journal on Optimization)
    Full Text Available 
  3. ( , Mathematical Programming)
    Full Text Available 
  4. ; ( , Mathematical Programming)
    Full Text Available 
  5. ; ( , Optimization letters)
    We provide the first positive result on the nonsmooth optimization landscape of robust principal component analysis, to the best of our knowledge. It is the object of several conjectures and remains mostly uncharted territory. We identify a necessary and sufficient condition for the absence of spurious local minima in the rank-one case. Our proof exploits the subdifferential regularity of the objective function in order to eliminate the existence quantifier from the first-order optimality condition known as Fermat’s rule. 
    more » « less
    Full Text Available