๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A path following algorithm for a class of convex programming problems

โœ Scribed by J. Zhu

Publisher
Springer
Year
1992
Tongue
English
Weight
653 KB
Volume
36
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Investigation of path-following algorith
Investigation of path-following algorithms for signomial geometric programming problems
โœ Hsu-Hao Yang; Dennis L. Bricker ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 722 KB

This paper considers signomial geometric programming (GP) dual problems, a class of nonconvex nonlinear programming problems possessing multiple locally optimal solutions. The primary purpose of this paper is to investigate the quality of solutions found by use of a path-following algorithm. The pat

Optimization algorithms for a class of n
Optimization algorithms for a class of nonlinear programming problems
โœ S. Chowdhury; M.A. Breuer ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 371 KB

A generalization of the theory of materials of type N to continuum damage mechanics is presented. Then algorithms developed earlier by the authors for plasticity problems are extended and applied to the analysis of progressive damage of materials under large elastoplastic deformation. Results obtain