Skip to main content

Technologies

You are here

CFSQP™ Version 2.3

Print Save as PDF

Overview

CFSQP™ is a set of C functions for the minimization of the maximum of a set of smooth objective functions. CFSQP is an implementation of two algorithms based on Sequential Quadratic Programming, modified so as to generate feasible iterates.

CFSQP™ is available for Academic/Non-profit use licensing. Please contact umventuresstore@umd.edu for more info.

Contact Info

UM Ventures
0134 Lee Building
7809 Regents Drive
College Park, MD 20742
Email: umdtechtransfer@umd.edu
Phone: (301) 405-3947 | Fax: (301) 314-9502