Search
Now showing items 1-7 of 7
Unconstrained Methods in Optimization
(University of Wisconsin-Madison Department of Computer Sciences, 1974)
Unconstrained Lagrangians in Nonlinear Programming
(University of Wisconsin-Madison Department of Computer Sciences, 1974)
The main purpose of this work is to associate a wide class of Lagrangian functions with a nonconvex, inequality and equality constrained optimization problem in such a way that unconstrained stationary points and local ...
Solution of Symmetric Linear Complementarity Problems by Iterative Methods
(University of Wisconsin-Madison Department of Computer Sciences, 1976)
A unified treatment is given for iterative algorithms for the solution of the symmetric 1inear complementarity problem: Mx + q > 0, x > 0, xT(Mx+q) = 0, where M is a given nxn symmetric real matrix and q is a given nxl ...
Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
(University of Wisconsin-Madison Department of Computer Sciences, 1977)
Techniques of Optimization
(University of Wisconsin-Madison Department of Computer Sciences, 1971)
This paper describes computational algorithms for solving unconstrained and contrained optimization problems.
Monotone Splitting of Matrices
(University of Wisconsin-Madison Department of Computer Sciences, 1970)
Unconstrained Methods in Nonlinear Programming
(University of Wisconsin-Madison Department of Computer Sciences, 1975)