skip to main content

Search for: All records

Award ID contains: 1832688

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. Free, publicly-accessible full text available July 1, 2024
  2. Free, publicly-accessible full text available March 1, 2024
  3. Free, publicly-accessible full text available January 1, 2024
  4. Free, publicly-accessible full text available January 1, 2024
  5. Free, publicly-accessible full text available December 1, 2023
  6. Free, publicly-accessible full text available November 1, 2023
  7. Free, publicly-accessible full text available June 1, 2023
  8. We consider nonconvex constrained optimization problems and propose a new approach to the convergence analysis based on penalty functions. We make use of classical penalty functions in an unconventional way, in that penalty functions only enter in the theoretical analysis of convergence while the algorithm itself is penalty free. Based on this idea, we are able to establish several new results, including the first general analysis for diminishing stepsize methods in nonconvex, constrained optimization, showing con- vergence to generalized stationary points, and a complexity study for sequential quadratic programming–type algorithms.