A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms

1985 ◽  
Vol 23 (5) ◽  
pp. 657-674 ◽  
Author(s):  
J. G. Ecker ◽  
M. Kupferschmid
Keyword(s):  
Nonlinear Programming ◽  
Ellipsoid Algorithm ◽  
Nonlinear Programming Algorithms ◽  
Programming Algorithms ◽  
Computational Comparison

The Utility of Nonlinear Programming Algorithms: A Comparative Study—Part II

1980 ◽  
Vol 102 (3) ◽  
pp. 547-551 ◽  
Author(s):  
E. Sandgren ◽  
K. M. Ragsdell
Keyword(s):  
Nonlinear Programming ◽  
Comparative Study ◽  
Engineering Design ◽  
Linear Approximation ◽  
Computational Time ◽  
Approximation Methods ◽  
Algorithm Performance ◽  
Nonlinear Programming Algorithms ◽  
Performance Curves ◽  
Programming Algorithms

A comprehensive comparative study of nonlinear programming algorithms, as applied to problems in engineering design, is presented. Linear approximation methods, interior penalty and exterior penalty methods were tested on a set of thirty problems and are rated on their ability to solve problems within a reasonable amount of computational time. In this paper, we give and discuss numerical results and algorithm performance curves.

The Utility of Nonlinear Programming Algorithms: A Comparative Study—Part I

1980 ◽  
Vol 102 (3) ◽  
pp. 540-546 ◽  
Author(s):  
E. Sandgren ◽  
K. M. Ragsdell
Keyword(s):  
Nonlinear Programming ◽  
Comparative Study ◽  
Engineering Design ◽  
Companion Paper ◽  
Computational Time ◽  
Approximation Methods ◽  
Algorithm Performance ◽  
Nonlinear Programming Algorithms ◽  
Performance Curves ◽  
Programming Algorithms

A comprehensive comparative study of nonlinear programming algorithms, as applied to problems in engineering design, is presented. Linear approximation methods, interior penalty and exterior penalty methods were tested on a set of thirty problems and are rated on their ability to solve problems within a reasonable amount of computational time. In this paper we discuss the organization and conduct of the study, and in a companion paper, we give numerical results and algorithm performance curves.

Sign in / Sign up

Export Citation Format

Share Document