Skip to the ledger

GrantClerk

NSF award 2541022 · University of California-Berkeley

CAREER: Foundations and Algorithms for Nonconvex Nonsmooth Optimization: From Local Solvers to Global Certification

Final report due

29 July 2031

in 1,745 days · The award ends on 31 March 2031.

GrantClerk is a private service. We are not NSF or any government agency.

Dates this award owes

NSF emails you about this too.

  • Decide about an extension1 Dec 2030in 1505 days

    award ending 2031-03-31 · Research.gov

  • Extension request14 Feb 2031in 1580 days

    award ending 2031-03-31 · Research.gov

  • No-cost extension notice21 Mar 2031in 1615 days

    award ending 2031-03-31 · Research.gov

  • Final report due29 Jul 2031in 1745 days

    award ending 2031-03-31 · Research.gov

  • Project outcomes report due29 Jul 2031in 1745 days

    award ending 2031-03-31 · Research.gov

  • Award is closed out29 Jul 2031in 1745 days

    award ending 2031-03-31 · Research.gov

Annual report dates come from the budget period on your award notice. That date is not public, so it is not shown here.

How we got this date

  1. NSF lists this award's end date as 31 March 2031.
  2. NSF rules say the final report is due no later than 120 days after that.
  3. So the final report is due by 29 July 2031.

Read the rule on Research.gov

Get a note before each report date

Add this award to your desk. We email you before each date and keep the dates in one place.

Renews each year until you cancel. Cancel any time from your account.

Already a member? Sign in

Award card

Award number
2541022
Period of support
15 Apr 2026 – 31 Mar 2031
Amount
$631,492
Awardee
University of California-Berkeley, Berkeley, CA
Program
Comm & Information Foundations
Directorate
CSE

Abstract

Optimization serves as the mathematical engine powering modern artificial intelligence and complex decision-making systems. Many real-world challenges, however, ranging from managing energy grids to training machine learning models, involve mathematical landscapes that are jagged, unpredictable, and obscured by data noise. These irregularities often trap existing technologies in suboptimal or inefficient solutions.…

Is this right?

We copy this from the public NSF award record. Your award notice and NSF always win. If a date looks wrong, check Research.gov.