22 March 1996 Foundations of a strong monotonicity theorem
Author Affiliations +
Proceedings Volume 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics; (1996) https://doi.org/10.1117/12.235508
Event: Fourth International Conference on Computer-Aided Design and Computer Graphics, 1995, Wuhan, China
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.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Douglass J. Wilde, Douglass J. Wilde, } "Foundations of a strong monotonicity theorem", Proc. SPIE 2644, Fourth International Conference on Computer-Aided Design and Computer Graphics, (22 March 1996); doi: 10.1117/12.235508; https://doi.org/10.1117/12.235508
PROCEEDINGS
6 PAGES


SHARE
Back to Top