
NSF Org: |
DMS Division Of Mathematical Sciences |
Recipient: |
|
Initial Amendment Date: | May 27, 2021 |
Latest Amendment Date: | May 27, 2021 |
Award Number: | 2110722 |
Award Instrument: | Standard Grant |
Program Manager: |
Yuliya Gorb
ygorb@nsf.gov (703)292-2113 DMS Division Of Mathematical Sciences MPS Directorate for Mathematical and Physical Sciences |
Start Date: | July 15, 2021 |
End Date: | June 30, 2025 (Estimated) |
Total Intended Award Amount: | $150,000.00 |
Total Awarded Amount to Date: | $150,000.00 |
Funds Obligated to Date: |
|
History of Investigator: |
|
Recipient Sponsored Research Office: |
202 HIMES HALL BATON ROUGE LA US 70803-0001 (225)578-2760 |
Sponsor Congressional District: |
|
Primary Place of Performance: |
Baton Rouge, LA LA US 70803-2701 |
Primary Place of
Performance Congressional District: |
|
Unique Entity Identifier (UEI): |
|
Parent UEI: |
|
NSF Program(s): | COMPUTATIONAL MATHEMATICS |
Primary Program Source: |
|
Program Reference Code(s): |
|
Program Element Code(s): |
|
Award Agency Code: | 4900 |
Fund Agency Code: | 4900 |
Assistance Listing Number(s): | 47.049 |
ABSTRACT
This project will advance fundamental algorithmic theory and software tools for solving optimization problems with wide applications in science, engineering and industry. Specifically, the project will be in the area of structured nonconvex nonlinear optimization, a critical component in many modern applications ranging from signal/image processing, real-time optimal control to stochastic learning. The project aims to develop algorithms with focus on the following features: speed, problem dependence, and ease of use for researchers in both optimization and computational data science community. Students will be involved and will have opportunities for interdisciplinary research. Software will be developed.
This project will develop theoretically strong and numerically efficient algorithms as well as the software for solving nonconvex structured optimization. These algorithms will solve the subproblems inexactly with guaranteed global convergence as well as feature an optimal computational complexity when the problem features convexity structure. The algorithms will be based on recent work on proximal and stochastic gradient methods for structured composite minimization, inexact alternating direction multiplier methods (ADMM) for separable convex/nonconvex optimization and active set methods for polyhedral constrained optimization. In addition, second-order techniques for accelerating the convergence will be also explored.
This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH
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).
Some links on this page may take you to non-federal websites. Their policies may differ from
this site.
Please report errors in award information by writing to: awardsearch@nsf.gov.