FSQP Version 2.4 (ISR IP)

ISR intellectual property available to license

Inventors
André Tits, Jian Zhou

Description
FSQP™ 2.4 is a set of Fortran subroutines for the minimization of the maximum of a set of smooth objective functions (possibly a single one) subject to nonlinear smooth inequality constraints, linear inequality and linear equality constraints, and simple bounds on the variables. If the initial guess provided by the user is infeasible, FSQP™ first generates a feasible point; subsequently, the successive iterates generated by FSQP™ all satisfy the constraints. The user has the option of requiring that the maximum value among the objective functions decrease at each iteration after feasibility has been reached (monotone line search). The user must provide subroutines that define the objective functions and constraint functions and may either provide subroutines to compute the gradients of these functions or require that FSQP™ estimate them by forward finite differences.

For more information
If you would like to license this intellectual property, have questions, would like to contact the inventors, or need more information, contact ISR External Relations Director Jeff Coriale at coriale@umd.edu or 301.405.6604.

Find more ISR IP
You can go to our categorical IP search page to search by research category or faculty name. Or view the entire list of available IP on our main IP search page.

ISR-IP-Andre ISR-IP-FSQP ISR-IP-optimization ISR-IP-software

Related Articles:
RFSQP™ Version 1.0 (ISR IP)
FFSQP Version 3.5 (ISR IP)
CFSQP Version 2.3 (ISR IP)
Optimal Data Diagnosis Algorithms (ISR IP)
A Computational Algorithm for Solar Reflector Optimization with Novel Applications in Concentrating Photovoltaic Solar Collector Design (ISR IP)
Indexing RDF and Temporal RDF Databases (ISR IP)
The T-REX RDF Extraction System (ISR IP)
A Tree-to-Graph Folding Procedure for Systems Engineering Requirements (ISR IP)
HCE: Hierarchical Clustering Explorer (ISR IP)
Treemap 4.0 (ISR IP)

June 15, 2007