Computational methods for optimum design of large complex systems
Computational procedures for optimal design of large complex systems are described. Requirements of a good algorithm are discussed. A general design optimization model applicable to several classes of problems is defined. Several optimization algorithms are outlined and differences between them are highlighted. Modern algorithms generate and use approximate Hessian of the Lagrange function to calculate the search direction. They are quite reliable and become extremely efficient when a potential constraint strategy is incorporated into them. Based on recent experience with them, they are recommended for general engineering design applications. Several other computational aspects are also discussed, such as robust implementation of algorithms, use of knowledge base in providing consulting and diagnostic support to the designer, interactive use of optimization, and role of a database and database management system in design optimization.
- On implementation of computational algorithms for optimal design 2: Extensive numerical investigation
- Optimum design of structures with multiple constraints
- Constrained conjugate directions methods for design optimization of large systems
- Performance of some SQP algorithms on structural design problems
- scientific article; zbMATH DE number 193574
- A Computational Study of Transformation Methods for Optimal Design
- A globally convergent method for nonlinear programming
- A hybrid optimization method and its role in computer-aided design
- A recursive quadratic programming method with active set strategy for optimal design
- A study of mathematical programming methods for structural optimization. Part I: Theory
- Algorithms for nonlinear constraints that use lagrangian functions
- An algorithm for engineering design optimization
- An approach to multicriterion optimization problems for engineering design
- Analysis of optimality criteria and gradient projection methods for optimal structural design
- Approximate structural reanalysis based on series expansion
- Design sensitivity analysis and optimization of dynamic response
- Design sensitivity analysis of structural systems
- Discrete-continuous variable structural synthesis using dual methods
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3902594 (Why is no real title available?)
- scientific article; zbMATH DE number 3926410 (Why is no real title available?)
- scientific article; zbMATH DE number 4062707 (Why is no real title available?)
- scientific article; zbMATH DE number 3456560 (Why is no real title available?)
- scientific article; zbMATH DE number 3511890 (Why is no real title available?)
- scientific article; zbMATH DE number 3526459 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 3606061 (Why is no real title available?)
- scientific article; zbMATH DE number 3993295 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3402374 (Why is no real title available?)
- Methods for Computing and Modifying the LDV Factors of a Matrix
- Nonlinear programming codes. Information, tests, performance
- On Structural Optimization
- On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
- Potential of Transformation Methods in Optimal Design
- Simultaneous analysis and design
- Some examples of cycling in variable metric methods for constrained minimization
- Structural design sensitivity analysis of nonlinear response
- Structural Optimization-Past, Present, and Future
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Test examples for nonlinear programming codes
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
- Uses of artificial intelligence in design optimization
- scientific article; zbMATH DE number 4167810 (Why is no real title available?)
- On implementation of computational algorithms for optimal design 2: Extensive numerical investigation
- Methods of optimization and systems analysis for problems of transcomputational complexity.
- Physical programming - Effective optimization for computational design
- Optimization of large-scale complex systems
This page was built for publication: Computational methods for optimum design of large complex systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820022)
