NSF award 2617599 · Princeton University

Collaborative Research: AF: Medium: Polynomial Optimization: Algorithms, Certificates and Applications

Final report due

28 September 2027

in 345 days · The award ends on 31 May 2027.

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 extension31 Jan 2027in 105 days
award ending 2027-05-31 · Research.gov
This one is ours, not NSF’s.
Extension request16 Apr 2027in 180 days
award ending 2027-05-31 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice21 May 2027in 215 days
award ending 2027-05-31 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due28 Sep 2027in 345 days
award ending 2027-05-31 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due28 Sep 2027in 345 days
award ending 2027-05-31 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out28 Sep 2027in 345 days
award ending 2027-05-31 · Research.gov
PAPPG 24-1: “financially closed out 120 days after their expiration date”

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

NSF lists this award's end date as 31 May 2027.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 28 September 2027.

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: 2617599
Period of support: 1 Dec 2025 – 31 May 2027
Amount: $600,000
Awardee: Princeton University, Princeton, NJ
Program: Algorithmic Foundations
Directorate: CSE

Abstract

Computational problems arising in diverse fields of sciences and engineering can be modeled as optimizing an appropriate objective function subject to a set of constraints. A case of wide interest that captures a surprising array of problems is when the objective function is a polynomial of low-degree. A rich body of theoretical and applied work has led to a fairly extensive understanding of algorithms and hardness…

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.