Vol. 88, No. 1, 1980

Recent Issues
Vol. 309: 1  2
Vol. 308: 1  2
Vol. 307: 1  2
Vol. 306: 1  2
Vol. 305: 1  2
Vol. 304: 1  2
Vol. 303: 1  2
Vol. 302: 1  2
Online Archive
The Journal
Editorial Board
Submission Guidelines
Submission Form
Policies for Authors
ISSN: 1945-5844 (e-only)
ISSN: 0030-8730 (print)
Special Issues
Author Index
To Appear
Other MSP Journals
An analogue of Moreau’s proximation theorem, with application to the nonlinear complementarity problem

Lynn McLinden

Vol. 88 (1980), No. 1, 101–161

This paper concerns the problem of minimizing a convex function subject to nonnegativity constraints, an associated nonlinear complementarity problem, and a new approach to solving these problems. The approach involves solving a sequence of nicer problems which approximate the given ones better and better, and our focus is on certain natural “trajectories” of solutions of the approximating problems. Existence, characterization, and continuous dependence of the solutions is obtained by establishing a complete analogue of Moreau’s Proximation Theorem. From this analogue also follow two new facts about the geometric nature of the graphs of subdifferentials in Rn, as well as new information about monotone conjugacy for coordinatewise nondecreasing convex functions on the nonnegative orthant. The largest part of the paper is then devoted to developing a number of rather strong properties of the solution trajectories, particularly as regards the nature of their convergence. Perhaps the most striking property is that these trajectories will locate a maximal strictly complementary solution which, furthermore, can be arranged to have a certain prescribed strong Pareto optimality property. The arithmetic-geometric mean inequality enters decisively at several key points, and the proofs generally rely strongly upon the techniques of finite-dimensional convex analysis.

Mathematical Subject Classification 2000
Primary: 90C33
Secondary: 90C25
Received: 4 January 1978
Published: 1 May 1980
Lynn McLinden