scispace - formally typeset
Search or ask a question
Author

Krister Svanberg

Bio: Krister Svanberg is an academic researcher. The author has contributed to research in topics: Nonlinear programming & Hessian matrix. The author has an hindex of 1, co-authored 1 publications receiving 846 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: This paper deals with a certain class of optimization methods, based on conservative convex separable approximations (CCSA), for solving inequality-constrained nonlinear programming problems, and it is proved that the sequence of iteration points converges toward the set of Karush--Kuhn--Tucker points.
Abstract: This paper deals with a certain class of optimization methods, based on conservative convex separable approximations (CCSA), for solving inequality-constrained nonlinear programming problems. Each generated iteration point is a feasible solution with lower objective value than the previous one, and it is proved that the sequence of iteration points converges toward the set of Karush--Kuhn--Tucker points. A major advantage of CCSA methods is that they can be applied to problems with a very large number of variables (say 104--105) even if the Hessian matrices of the objective and constraint functions are dense.

1,015 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: An overview, comparison and critical review of the different approaches to topology optimization, their strengths, weaknesses, similarities and dissimilarities and suggests guidelines for future research.
Abstract: Topology optimization has undergone a tremendous development since its introduction in the seminal paper by Bendsoe and Kikuchi in 1988. By now, the concept is developing in many different directions, including “density”, “level set”, “topological derivative”, “phase field”, “evolutionary” and several others. The paper gives an overview, comparison and critical review of the different approaches, their strengths, weaknesses, similarities and dissimilarities and suggests guidelines for future research.

1,816 citations

Journal ArticleDOI
TL;DR: Topology optimization is the process of determining the optimal layout of material and connectivity inside a design domain this paper, which is the same as the problem of finding the optimal configuration of a set of components.
Abstract: Topology optimization is the process of determining the optimal layout of material and connectivity inside a design domain. This paper surveys topology optimization of continuum structures from the year 2000 to 2012. It focuses on new developments, improvements, and applications of finite element-based topology optimization, which include a maturation of classical methods, a broadening in the scope of the field, and the introduction of new methods for multiphysics problems. Four different types of topology optimization are reviewed: (1) density-based methods, which include the popular Solid Isotropic Material with Penalization (SIMP) technique, (2) hard-kill methods, including Evolutionary Structural Optimization (ESO), (3) boundary variation methods (level set and phase field), and (4) a new biologically inspired method based on cellular division rules. We hope that this survey will provide an update of the recent advances and novel applications of popular methods, provide exposure to lesser known, yet promising, techniques, and serve as a resource for those new to the field. The presentation of each method's focuses on new developments and novel applications.

1,052 citations

Proceedings ArticleDOI
01 Oct 2017
TL;DR: This work learns a mapping from the source to the target domain by jointly solving an assignment problem that labels those target instances that potentially belong to the categories of interest present in the source dataset.
Abstract: When the training and the test data belong to different domains, the accuracy of an object classifier is significantly reduced. Therefore, several algorithms have been proposed in the last years to diminish the so called domain shift between datasets. However, all available evaluation protocols for domain adaptation describe a closed set recognition task, where both domains, namely source and target, contain exactly the same object classes. In this work, we also explore the field of domain adaptation in open sets, which is a more realistic scenario where only a few categories of interest are shared between source and target data. Therefore, we propose a method that fits in both closed and open set scenarios. The approach learns a mapping from the source to the target domain by jointly solving an assignment problem that labels those target instances that potentially belong to the categories of interest present in the source dataset. A thorough evaluation shows that our approach outperforms the state-of-the-art.

509 citations

Journal ArticleDOI
TL;DR: This work exemplifies its method by studies of steady‐state Navier–Stokes flow problems, thus extending the work by Borrvall and Petersson on topology optimization of fluids in Stokes flow.
Abstract: We present a versatile high-level programming-language implementation of non-linear topology optimization. Our implementation is based on the commercial software package FEMLAB, and it allows a wide range of optimization objectives to be dealt with easily. We exemplify our method by studies of steady-state Navier–Stokes flow problems, thus extending the work by Borrvall and Petersson on topology optimization of fluids in Stokes flow (Int. J. Num. Meth. Fluids 2003; 41:77–107). We analyse the physical aspects of the solutions and how they are affected by different parameters of the optimization algorithm. A complete example of our implementation is included as FEMLAB code in an appendix. Copyright © 2005 John Wiley & Sons, Ltd.

377 citations

Journal ArticleDOI
TL;DR: In this article, the state-of-the-art developments in the design for additive manufacturing (DfAM) and structural optimisation, becomes vital for successfully shaping the future AM-landscape.

330 citations