Project Grant 2208386
Award Date
8/15/22
Completion Date
7/31/25
Dollars Obligated
$171K
Federal Agency
Division of Mathematical Sciences
Federal Grant Program
47.049
Assistance Type
Project Grant
Place of Performance
Norfolk, VA 23508, USA
Similar Awards
This $155,783 National Science Foundation project grant under the Mathematical and Physical Sciences program (CFDA 47.049) funds collaborative research at Syracuse University to develop computationally efficient methods for non-smooth and non-convex optimization by exploring sparsity structures in large data sets. The research aims to address critical issues in non-smooth, non-convex optimization arising from sparse modeling of data for applications including machine learning and sparse...
This Project Grant award of $134,150 from the National Science Foundation's (NSF) Mathematical and Physical Sciences Program (CFDA 47.049) supports research by the University of Pennsylvania to advance the design, analysis, and deployment of rigorously justified nonconvex optimization algorithms. The project aims to create guaranteed procedures for training practical machine learning systems with improved reliability, robustness, and efficiency. Specifically, the research will focus on...
This three-year Project Grant from the National Science Foundation's Division of Computing and Communication Foundations under the Computer and Information Science and Engineering program will support the development of new optimization approaches for machine learning problems. The $600,000 award to the University of Wisconsin-Madison beginning October 1, 2022 will advance optimization algorithms and analysis techniques for convex-concave minimax problems incorporating sparsity or regularity....
This Project Grant award of $162,576.00 from the National Science Foundation's (NSF) Mathematical and Physical Sciences program (CFDA 47.049) will support research on using interacting particle systems and collective intelligence to solve challenging nonconvex optimization problems. The project aims to develop a gradient-free optimization method inspired by consensus-based interacting particle systems to efficiently explore the landscape and converge on global minimizers for different types of...
This $300,000 federal Project Grant award from the National Science Foundation's (NSF) Division of Mathematical Sciences will fund research to develop new mathematical techniques for optimization in the context of big data and contemporary data science challenges. The principal investigator at Cornell University will lead this 3-year project, which aims to transform the design and analysis of optimization algorithms across diverse fields including machine learning, statistics, and control...
This $250,000 Project Grant award from the National Science Foundation's (NSF) Mathematical and Physical Sciences (CFDA 47.049) program supports research by the University of California, San Diego (UCSD) on the development of "tight relaxation methods" for solving challenging optimization problems, such as polynomial optimization, generalized Nash equilibria, and matrix-constrained polynomial optimization. The project aims to create efficient computational methods for locating global...
This $275,000 Project Grant from the National Science Foundation's (NSF) Division of Mathematical Sciences under the Mathematical and Physical Sciences (CFDA 47.049) program supports research on optimization algorithms and digital twins constrained by partial differential equations (PDEs) that incorporate data to make decisions resilient to uncertainty. The research will develop: (1) inexact adaptive semismooth Newton and trust-region methods to solve these optimization problems; (2) primal dual...
This National Science Foundation project grant of $250,000 will fund research at Rensselaer Polytechnic Institute from July 2022 to June 2025 under the Mathematical and Physical Sciences program (CFDA 47.049). The grant supports the development of accelerated distributed stochastic optimization methods and applications in machine learning. Specifically, the grantee will design fast-convergent and communication-efficient optimization algorithms with theoretical guarantees for solving...
This $118,760 Project Grant award from the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program will support research to advance the state-of-the-art in optimization theory and algorithms for modern data science problems. The 5-year project at The Johns Hopkins University aims to develop novel tools to analyze the computational and statistical complexity of optimization heuristics, and design new algorithms that can better leverage the inherent...
This National Science Foundation project grant of $199,968 supports collaborative research at Tufts University from September 2022 through August 2025 under the Mathematical and Physical Sciences program (CFDA 47.049). The research aims to advance theory and computation for structured sensing problems involving low-rank matrix recovery from deterministically structured measurements. Specifically, the project will study scalable non-convex optimization methods for generalized matrix completion...