Project Grant 2308597
Award Date
10/1/22
Completion Date
9/30/24
Dollars Obligated
$252K
Federal Agency
Division of Computing and Communication Foundations
Federal Grant Program
47.070
Assistance Type
Project Grant
Place of Performance
Houston, TX 77005, USA
Similar Awards
This Project Grant award of $299,549 from the National Science Foundation's (NSF) Division of Computing and Communication Foundations, under the Computer and Information Science and Engineering program (CFDA #47.070), provides funding to William Marsh Rice University to conduct collaborative research on large-scale bilevel optimization problems. The project aims to develop new theory, algorithms, and applications for bilevel optimization, which has important implications for emerging fields like...
This Project Grant awarded by the National Science Foundation (NSF) under the Mathematical and Physical Sciences (CFDA 47.049) program provides $219,328 to Lehigh University to design, analyze, and implement gradient-sampling-based algorithms for solving locally Lipschitz optimization problems with nonconvex and nonsmooth objective functions. The project aims to extend contemporary gradient-sampling algorithms to handle computational and stochastic noise in function and derivative evaluations,...
This Project Grant award from the National Science Foundation (CFDA 47.049 - Mathematical and Physical Sciences) to Rensselaer Polytechnic Institute (RPI) provides $220,000 to develop new stochastic algorithms for solving minimax-structured nonconvex and nonsmooth optimization problems. The research aims to improve the robustness of deep learning models against adversarial attacks, with applications in areas like game theory, statistics, engineering, and machine learning. Key deliverables...
This $162,576 Project Grant award from the National Science Foundation's (NSF) Mathematical and Physical Sciences (CFDA 47.049) program will support research at the University of California, Los Angeles (UCLA) to develop gradient-free optimization methods inspired by interacting particle systems for solving nonconvex optimization problems. The project aims to leverage collective intelligence principles to efficiently explore the landscape and converge to global minimizers for different types...
The National Science Foundation awarded a $250,000 Project Grant to the Texas A&M Engineering Experiment Station to support research titled "Collaborative Research: Consensus and Distributed Optimization in Non-Convex Environments with Applications to Networked Machine Learning." The award is part of the NSF Engineering program (CFDA 47.041), which aims to foster innovation and excellence in engineering research. Under the three-year award concluding in July 2026, the Texas A&M...
This $250,000 Project Grant award from the National Science Foundation (NSF) Mathematical and Physical Sciences (CFDA 47.049) program supports the development and analysis of a novel class of first-order optimization methods called Low-Rank Gradient Flow (LRGF). The goal is to advance techniques for solving challenging non-convex optimization problems that arise in a wide range of applications such as computer-aided design, radiation therapy, manufacturing, inverse problems, and artificial...
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 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 Project Grant from the National Science Foundation's Mathematical and Physical Sciences program provides $171,089 to Old Dominion University Research Foundation for collaborative research developing 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 used in machine learning and sparse...
This Project Grant award of $134,150 from the National Science Foundation's (NSF) Mathematical and Physical Sciences (CFDA 47.049) program supports research by The Trustees of the University of Pennsylvania, doing business as the Clinical Practices of the University of Pennsylvania, on nonconvex optimization algorithms for statistical estimation and machine learning. The overarching goal is to develop a mathematical foundation to explain the performance and applications of these nonconvex...