User's guide for LSSOL (version 1.0): a Fortran package for constrained linear least squares and convex quadratic programming
Stanford University. Dept. of Operations Research. Systems Optimization Laboratory, Phillip E. Gill, Sven J. Hammarling, Walter Murray, Michael A. Saunders, Margaret H. Wright, United States. Dept. of Energy, National Science Foundation (U.S.), United States. Office of Naval Research, United States. Army Research Office
Systems Optimization Laboratory, Department of Operations Research, Stanford University, 1986 - 38 pages
17 pages matching least-squares matrix in this book
Results 1-3 of 17
What people are saying - Write a review
We haven't found any reviews in the usual places.
A(NROWA,N algorithm array of dimension BIGBND BL(j bound constraints CALL LSOPTN CALL LSSOL computed Cond constrained linear least-squares CONVEX QUADRATIC PROGRAMMING default value defined denote dimension at least DOUBLE PRECISION feasible point Fortran 77 FORTRAN PACKAGE Gill Hessian matrix inequality constraint initial working set Input INTEGER ISTATE laavA Lagrange multiplier least-squares matrix LENIW LENW linear constraints linear programming lower bound LSCODE files LSFILE LSMAIN machine constants MCHPAR NCLIN Nolist non-singular NROWA NROWC null space Numerical Algorithms Group objective function Optimality Phase Iteration options file Phase Iteration Limit Print Level printed constraint printed output printout Problem Type problems of type projected gradient punoq Rank Tolerance real array routines rows and columns search direction Section 4.2 Sequential quadratic programming solution source file specified string subroutine sum of infeasibilities TQ factorization triangular factor triangular matrix type LP unit number upper bound upper-trapezoidal upper-triangular USER'S GUIDE Weak minimum zero