Modal Trimming Method for Improving Local Optima of Nonlinear Programming Problems : Proposal of Method and Evaluation of Its Basic Performance

2002 ◽  
Vol 2002.5 (0) ◽  
pp. 201-206
Author(s):  
Ryohei Yokoyama ◽  
Koichi Ito
Author(s):  
P. Y. Papalambros

Abstract Solution strategies for optimal design problems in nonlinear programming formulations may require verification of optimality for constraint-bound points. These points are candidate solutions where the number of active constraints is equal to the number of design variables. Models leading to such solutions will typically offer little insight to design trade-offs and it would be desirable to identify them early, or exclude them in a strategy using active sets. Potential constrained-bound solutions are usually identified based on the principles of monotonicity analysis. This article discusses some cases where these points are in fact global or local optima.


1993 ◽  
Vol 115 (3) ◽  
pp. 374-379
Author(s):  
P. Y. Papalambros

Early preliminary models for optimal design problems in nonlinear programming formulations often have solutions that are constraint-bound points, i.e., the number of active constraints equals the number of design variables. Models leading to such solutions will typically offer little insight to design trade-offs, and it is desirable to identify them early in order to revise the model or to exclude the points from an active set strategy. Application of monotonicity analysis can quickly identify constraint-bound candidate solutions but not always prove their optimality. This article discusses some conditions under which these points are in fact global or local optima.


AIAA Journal ◽  
1999 ◽  
Vol 37 ◽  
pp. 588-593
Author(s):  
K. L. Chan ◽  
David Kennedy ◽  
Fred W. Williams

Sign in / Sign up

Export Citation Format

Share Document