Share Email Print

Proceedings Paper

Foundations of a strong monotonicity theorem
Author(s): Douglass J. Wilde
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Current monotonicity analysis of optimization problems has loose ends and loopholes which confuse the understanding, teaching and use of the techniques. These embarrassments are removed in this article by redefining slightly the domain, the objective and constraint functions, and even the notion of criticality itself. This leads to a simple and clear `Strong' Monotonicity Theorem giving extensions of the two monotonicity principles are straightforward corollaries. This theorem not only incorporates Hansen, Jaumard and Lu's extensions to non-monotonic functions, but also clarifies the special elimination rules applicable to variables in the constraints but not the objective. This sets the stage for analyzing optimization problems with non-monotonic functions.

Paper Details

Date Published: 22 March 1996
PDF: 6 pages
Proc. SPIE 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics, (22 March 1996); doi: 10.1117/12.235508
Show Author Affiliations
Douglass J. Wilde, Stanford Univ. (United States)

Published in SPIE Proceedings Vol. 2644:
Fourth International Conference on Computer-Aided Design and Computer Graphics
Shuzi Yang; Ji Zhou; Cheng-Gang Li, Editor(s)

© SPIE. Terms of Use
Back to Top