Refine
Has Fulltext
- yes (195)
Is part of the Bibliography
- yes (195)
Year of publication
Document Type
- Doctoral Thesis (108)
- Journal article (71)
- Book (5)
- Other (3)
- Conference Proceeding (2)
- Master Thesis (2)
- Preprint (2)
- Book article / Book chapter (1)
- Review (1)
Language
- English (195) (remove)
Keywords
- Optimale Kontrolle (11)
- Optimierung (8)
- optimal control (8)
- Extremwertstatistik (7)
- Nash-Gleichgewicht (7)
- Newton-Verfahren (6)
- Mathematik (5)
- Nichtlineare Optimierung (5)
- Extremwerttheorie (4)
- Nichtglatte Optimierung (4)
Institute
- Institut für Mathematik (195) (remove)
Sonstige beteiligte Institutionen
ResearcherID
- C-2593-2016 (1)
EU-Project number / Contract (GA) number
- 304617 (2)
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.
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.