Greedy permanent magnet optimization

A number of scientific fields rely on placing permanent magnets in order to produce a desired magnetic field. We have shown in recent work that the placement process can be formulated as sparse regression. However, binary, grid-aligned solutions are desired for realistic engineering designs. We now...

Full description

Bibliographic Details

Published in:	Nuclear fusion Vol. 63; no. 3; pp. 36016 - 36028
Main Authors:	Kaptanoglu, Alan A., Conlin, Rory, Landreman, Matt
Format:	Journal Article
Language:	English
Published:	IAEA IOP Publishing 01.03.2023
Subjects:	binary quadratic programs combinatorial optimization greedy algorithms permanent magnets quadratic knapsack problems sparse regression stellarators
ISSN:	0029-5515, 1741-4326
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!