Search
Now showing items 1-4 of 4
A Method for Approximating the Solution Set of a System of Convex Inequalities by Polytopes
(University of Texas at Arlington, 1990-12)
**Please note that the full text is embargoed** ABSTRACT: In this note a method for computing approximations by polytopes
of the solution set [see pdf for notation] of a system of
convex inequalities is presented. It ...
Generalized Gradient Methods for Solving Locally Lipschitz Feasibility Problems
(University of Texas at Arlington, 1990-12)
**Please note that the full text is embargoed** ABSTRACT: In this paper we study the behavior of a class of iterative
algorithms for solving feasibility problems, that is finite
systems of inequalities [see pdf for ...
On a Proximal Point Method for Optimization in Banach Spaces
(University of Texas at Arlington, 1997-02)
**Please note that the full text is embargoed** ABSTRACT: We analyze the behavior of a parallel proximal point method for solving convex optimization problems in reflexive Banach spaces. Similar algorithms were known to ...
On a Class of Bargaining Schemes for Points in the Core of a Cooperative N-Person Game
(University of Texas at Arlington, 1991-05)
**Please note that the full text is embargoed** ABSTRACT: Projection methods of solving convex feasibility problems lead naturally to a class of bargaining scheme's for points in the core of cooperative n-person games. ...