skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 2

Search for: All records

Award ID contains: 2110722

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).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Pacific Journal of Optimization)
    Free, publicly-accessible full text available May 5, 2026
  2. ; ; (, Computational Optimization and Applications)
    Free, publicly-accessible full text available March 1, 2026
  3. ; ; (, IEEE Transactions on Signal Processing)
    Free, publicly-accessible full text available January 1, 2026
  4. ; ; ; ; (, IEEE Internet of Things Journal)
    Free, publicly-accessible full text available January 1, 2026
  5. ; ; ; (, Communications of the American Mathematical Society)
    We construct a nonlinear least-squares finite element method for computing the smooth convex solutions of the Dirichlet boundary value problem of the Monge-Ampère equation on strictly convex smooth domains in R 2 {\mathbb {R}}^2 . It is based on an isoparametric C 0 C^0 finite element space with exotic degrees of freedom that can enforce the convexity of the approximate solutions.A priorianda posteriorierror estimates together with corroborating numerical results are presented. 
    more » « less
  6. ; ; ; ; (, IEEE Internet of Things Journal)
    Full Text Available 
  7. ; ; ; (, IEEE Transactions on Signal Processing)
    Full Text Available 
  8. ; (, Numerical Algebra, Control and Optimization)
    Full Text Available 
  9. ; (, ACM Transactions on Mathematical Software)
    The Polyhedral Active Set Algorithm (PASA) is designed to optimize a general nonlinear function over a polyhedron. Phase one of the algorithm is a nonmonotone gradient projection algorithm, while phase two is an active set algorithm that explores faces of the constraint polyhedron. A gradient-based implementation is presented, where a projected version of the conjugate gradient algorithm is employed in phase two. Asymptotically, only phase two is performed. Comparisons are given with IPOPT using polyhedral-constrained problems from CUTEst and the Maros/Meszaros quadratic programming test set. 
    more » « less
    Full Text Available 
  10. ; ; (, Journal of Optimization Theory and Applications)
    Full Text Available