Accession Number : ADA141699

Title :   Simple Bounds for Solutions of Monotone Complementarity Problems and Convex Programs.

Descriptive Note : Technical summary rept.,

Corporate Author : WISCONSIN UNIV-MADISON MATHEMATICS RESEARCH CENTER

Personal Author(s) : Mangasarian,O L ; McLinden,L

PDF Url : ADA141699

Report Date : Mar 1984

Pagination or Media Count : 17

Abstract : For a solvable monotone complementarity problem it is shown that each feasible point which is not a solution of the problem provides simple numerical bounds for some or all components of all solution vectors. Consequently for a solvable differentiable convex program each primal-dual feasible point which is not optimal provides simple numerical bounds for some or all components of all primal-dual solution vectors. Also given is existence result and simple bounds for solutions of monotone complementarity problems satisfying a new, distributed constraint qualification. This result carries over to a simple existence and boundedness result for differentiable convex programs satisfying a new, distributed constraint qualification. This result carries over to a simple existence and boundedness result for differentiable convex programs satisfying a similar constraint qualification. (Author)

Descriptors :   *Nonlinear programming, Optimization, Vector analysis, Problem solving, Solutions(General)

Subject Categories : Numerical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE