| SQOPT | Authors | Philip Gill
Walter Murray Michael Saunders |
| Language | Fortran 77 | |
| Algorithm | SQOPT is used as a subroutine inside SNOPT to solve a sequence of related quadratic programs, using warm starts. | |
| Input Format | May be called from a driver program, typically in Fortran, C or MATLAB | |
| Modeling Languages link | ||
| Commercial Status | Licensing Contact: Hans Wiesendanger, Licensing Associate, Stanford University Office of Technology Licensing E-Mail: hans@otlmail.stanford.edu Phone: (650) 723-0692 | |
| Platform | Any machine with a reasonable amount of memory and a Fortran compiler | |
| Remarks | SQOPT is a software package for solving large-scale linear and quadratic programs. The quadratic objective function may be positive definite or semidefinite (convex). Efficiency is best if many constraints are active at a solution. SQOPT is especially effective if the constraints have no feasible solution. Bounds on the variables and constraints are treated as "elastic" when necessary. SQOPT minimizes the sum of bound violations, perhaps including a multiple of the true objective in the minimization. The user specifies which bounds are elastic.
Numerically stable algorithms. Implicit definition of the quadratic objective via Qx products. Warm start capability. Elastic bounds on variables and constraints (for infeasible problems). | |
| References | P. E. Gill, W. Murray and M. A. Saunders, SQOPT 5.3 User's Guide, Report NA 97-4, Dept of Mathematics, University of California, San Diego (revised 1998). |
