CFSQP and FFSQP were originally
developed by Andre Tits' research group at the Institute
for Systems Research (ISR),
University of Maryland, College Park. Responsibility
for their further development and support was transferred
to AEM Design in 2000.
The first version of the
Fortran implementation of FSQP (FFSQP; initially simply
called FSQP) was released in 1989. The algorithm's main
architects were Dr. Eliane R. Panier and Prof.
Andre Tits at the University of Maryland. The implementation
was due to Jian Zhou. The first
version of the C implementation (CFSQP), carried out
Lawrence, followed in 1993.
The successive versions
of both packages were made widely available over the
Internet. As a result, voluminous feedback was received
over the years from the user community, in the form
of bug reports, suggested fixes, suggested enhancements,
etc. A few individuals deserve special recognition for
going well above and beyond the call of duty. Those
helping with CFSQP include Adam Schwartz of the University
of California, Berkeley, Greg Anderson of Intel, Martin
Wauchope of CRA, Australia, and Steven Drucker of MIT.
Those helping with FFSQP include Jaroslav Dolezal and
Jiri Fidler at CZ Academy of Sciences, Klaus Schittkowski
at U Bayreuth, and Yaguang Yang of the Institute for
Systems Research at the University of Maryland, College
Park. Their efforts went a long way to improving the
robustness and portability of the FSQP implementations.
Thanks to all!