The portable standard C and Fortran 77 versions of the Feasible Sequential Quadratic Programming (FSQP) software, developed in the department by a research group headed by Professor Andre’ Tits, are now used at more than 600 sites in 50 countries around the world.

FSQP is an optimization algorithm with many applications in controls engineering and mathematics. The algorithm was created and refined here over the past ten years.

Specifically, the FSQP algorithm is used for directly tackling optimization problems with: multiple competing linear/nonlinear objective functions (minimax), linear/nonlinear inequality constraints, and linear/nonlinear equality constraints. It also contains special provisions for maintaining “semi-feasibility” of each iterate and efficiently handling problems with many “sequentially related” objectives and/or constraints.

Applications of FSQP include: magnetic resonance imaging, clutter noise in over-the-horizon radar, robotic manipulation planners, hub-and-shaft assemblies for dual-wheel excavators, optimal protein separation, parametric surface polygonization, analysis of intermediately lethal tumors, hierarchical traffic control systems, failure detection and isolation, multi-purpose reservoir systems, neural net based predictive control, CONSOL-OPTCAD: an interactive optimization-based design package, aerosol thermodynamics, and more.

For-profit organizations may obtain FSQP/CFSQP free of charge for a three month evaluation period. If interested, please contact Ms. Carolyn Garrett (cg54@umail.umd.edu) at the Office of Technology Liaison, University of Maryland at College Park. Non-profit organizations may obtain a copy of the main source code files cfsqp.c and/or ffsqp.f free of charge via e-mail (andre@isr.umd.edu). The remainder of the CFSQP/FFSQP distributions are available at http://www.isr.umd.edu/Labs/CACSE/FSQP/fsqp_dist.html.

to Main Menu