SAL Home NUMERICS Optimization

FSQP

Portable implementations (in both C and Fortran) of the Feasible Sequential Quadratic Programming (FSQP) algorithm, a superlinearly convergent algorithm for directly tackling optimization problems with:

  • Multiple competing linear/nonlinear objective functions (minimax).
  • linear/nonlinear inequality constraints.
  • linear/nonlinear equality constraints.

Current Version:   2.5 (C version), 3.7 (Fortran Version)

License Type:   Free for Non-Profit organization. http://www.isr.umd.edu/Labs/CACSE/FSQP/fsqp_dist.html

Home Site:
http://www.isr.umd.edu/Labs/CACSE/FSQP/fsqp.html

Source Code Availability:

Yes

Available Binary Packages:

  • Debian Package:   No
  • RedHat RPM Package:   No
  • Other Packages:   No

Targeted Platforms:

Both C and Fortran versions have been tested and run successfully on most platforms, including Sun SPARCs, DECs, and IBM personal computers, Linux.

Software/Hardware Requirements:

None

Other Links:
None

Mailing Lists/USENET News Groups:

None

User Comments:

  • None

See A Screen Shot? (Not Yet)

  SAL Home   |   Numerical Analysis   |   Optimization


Comments? SAL@KachinaTech.COM
Copyright © 1995-2001 by Herng-Jeng Jou
Copyright © 1997-2001 by Kachina Technologies, Inc.
All rights reserved.