TY  - CHAP
A1  - Zillober, Christian
T1  - Sequential convex programming in theory and praxis
N2  - In this paper, convex approximation methods, suclt as CONLIN, the method of moving asymptotes (MMA) and a stabilized version of MMA (Sequential Convex Programming), are discussed with respect to their convergence behaviour. In an extensive numerical study they are :finally compared with other well-known optimization methods at 72 examples of sizing problems.
Y1  - 1993
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:20-opus-35513
ER  - 
TY  - JOUR
A1  - Kredler, Christian
A1  - Zillober, Christian
A1  - Johannes, Frank
A1  - Sigl, Georg
T1  - An application of preconditioned conjugate gradients to relative placement in chip design
N2  - In distance geometry problems and many other applications, we are faced with the optimization of high-dimensional quadratic functions subject to linear equality constraints. A new approach is presented that projects the constraints, preserving sparsity properties of the original quadratic form such that well-known preconditioning techniques for the conjugate gradient method remain applicable. Very-largescale cell placement problems in chip design have been solved successfully with diagonal and incomplete Cholesky preconditioning. Numerical results produced by a FORTRAN 77 program illustrate the good behaviour of the algorithm.
Y1  - 1993
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:20-opus-31996
ER  - 
TY  - JOUR
A1  - Schittkowski, K.
A1  - Zillober, Christian
A1  - Zotemantel, R.
T1  - Numerical comparison of nonlinear programming algorithms for structural optimization
N2  - No abstract available
Y1  - 1994
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:20-opus-31971
ER  - 
TY  - JOUR
A1  - Zillober, Christian
T1  - A globally convergent version of the method of moving asymptotes
N2  - No abstract available
Y1  - 1993
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:20-opus-31984
ER  -