LPDP(3)

SYNOPSIS
SUBROUTINE LPDP (A, MDA, M, N1, N2, PRGOPT, X, WNORM, MODE, WS, + IS)

NAME
lpdp - Subsidiary to LSEI

LIBRARY
SLATEC

TYPE
SINGLE PRECISION (LPDP-S, DLPDP-D)

AUTHOR
Hanson, R. J., (SNLA) Haskell, K. H., (SNLA)

DESCRIPTION
DIMENSION A(MDA,N+1),PRGOPT(*),X(N),WS((M+2)*(N+7)),IS(M+N+1), where N=N1+N2. This is a slight overestimate for WS(*). Determine an N1-vector W, and an N2-vector Z which minimizes the Euclidean length of W subject to G*W+H*Z .GE. Y. This is the least projected distance problem, LPDP. The matrices G and H are of respective dimensions M by N1 and M by N2. Called by subprogram LSI( ). The matrix (G H Y) occupies rows 1,...,M and cols 1,...,N1+N2+1 of A(*,*). The solution (W) is returned in X(*). (Z) The value of MODE indicates the status of the computation after returning to the user. MODE=1 The solution was successfully obtained. MODE=2 The inequalities are inconsistent.

SEE ALSO
LSEI

ROUTINES CALLED
SCOPY, SDOT, SNRM2, SSCAL, WNNLS

REVISION HISTORY (YYMMDD)
790701 DATE WRITTEN
891214 Prologue converted to Version 4.0 format. (BAB)
900328 Added TYPE section. (WRB)
910408 Updated the AUTHOR section. (WRB)