Anders Forsgren

Anders Forsgren

Auto-generated profile, based on publicly available information

Anders Forsgren

Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, Stockholm, Sweden

Research Focus & Metrics

Academic Career Length

38Years (1989-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 December 2015 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
AFAnders Forsgren
Anders Forsgren
PGPhilip E. Gill
Philip E. Gill
EWElizabeth Wong
Elizabeth Wong

28 April 2021 in Computational Optimization and Applications
Verified
Journal Article
Open access
PDF file
DEDavid Ek
David Ek
AFAnders Forsgren
Anders Forsgren
The main focus in this paper is exact linesearch methods for minimizing a quadratic function whose Hessian is positive definite. We give a class of limited-memory quasi-Newton Hessian approximations which generate search directions parallel to those of the BFGS method, or equivalently, to those of the method of preconditioned conjugate gradients. In the setting of reduced Hessians, the class provides a dynamical framework for the construction of limited-memory quasi-Newton methods. These methods attain finite termination on quadratic optimization problems in exact arithmetic. We show performance of the methods within this framework in finite precision arithmetic by numerical simulations on sequences of related systems of linear equations, which originate from the CUTEst test collection. In addition, we give a compact representation of the Hessian approximations in the full Broyden class for the general unconstrained optimization problem. This representation consists of explicit matrices and gradients only as vector components.

22 August 2006 in Annals of Operations Research
Verified
Journal Article
Closed access
PDF file
FCFredrik Carlsson
Fredrik Carlsson
AFAnders Forsgren
Anders Forsgren
HRHenrik Rehbinder
Henrik Rehbinder
KEKjell Eriksson
Kjell Eriksson

31 August 2017 in Computational Optimization and Applications
Verified
Journal Article
Open access
PDF file
AFAnders Forsgren
Anders Forsgren
TOTove Odland
Tove Odland
This paper concerns exact linesearch quasi-Newton methods for minimizing a quadratic function whose Hessian is positive definite. We show that by interpreting the method of conjugate gradients as a particular exact linesearch quasi-Newton method, necessary and sufficient conditions can be given for an exact linesearch quasi-Newton method to generate a search direction which is parallel to that of the method of conjugate gradients. We also analyze update matrices and give a complete description of the rank-one update matrices that give search direction parallel to those of the method of conjugate gradients. In particular, we characterize the family of such symmetric rank-one update matrices that preserve positive definiteness of the quasi-Newton matrix. This is in contrast to the classical symmetric-rank-one update where there is no freedom in choosing the matrix, and positive definiteness cannot be preserved. The analysis is extended to search directions that are parallel to those of the preconditioned method of conjugate gradients in a straightforward manner.

11 April 2025 in Medical Physics
Verified
Journal Article
Open access
IBIvar Bengtsson
Ivar Bengtsson
AFAnders Forsgren
Anders Forsgren
AFAlbin Fredriksson
Albin Fredriksson
YZYe Zhang
Ye Zhang
Background: The steep dose gradients obtained with pencil beam scanning allow for precise targeting of the tumor but come at the cost of high sensitivity to uncertainties. Robust optimization is commonly applied to mitigate uncertainties in density and patient setup, while its application to motion management, called 4D‐robust optimization (4DRO), is typically accompanied by other techniques, including gating, breath‐hold, and re‐scanning. In particular, current commercial implementations of 4DRO do not model the interplay effect between the delivery time structure and the patient's motion. Purpose : Interplay‐robust optimization (IPRO) has previously been proposed to explicitly model the interplay‐affected dose during treatment planning. It has been demonstrated that IPRO can mitigate the interplay effect given the uncertainty in the patient's breathing frequency. In this study, we investigate and evaluate IPRO in the context where the motion uncertainty is extended to also include variations in breathing amplitude. Methods : The compared optimization methods are applied and evaluated on a set of lung patients. We model the patients' motion using synthetic 4D computed tomography (s4DCT), each created by deforming a reference CT based on a motion pattern obtained with 4D magnetic resonance imaging. Each (s4DCT) contains multiple breathing cycles, partitioned into two sets for scenario generation: one for optimization and one for evaluation. Distinct patient motion scenarios are then created by randomly concatenating breathing cycles varying in period and amplitude. In addition, a method considering a single breathing cycle for generating optimization scenarios (IPRO‐1C) is developed to investigate to which extent robustness can be achieved with limited information. Both IPRO and IPRO‐1C were investigated with 9, 25, and 49 scenarios. Results : For all patient cases, IPRO and IPRO‐1C increased the target coverage in terms of the near‐worst‐case (5th percentile) CTV D98, compared to 4DRO. After normalization of plan doses to equal target coverage, IPRO with 49 scenarios resulted in the greatest decreases in OAR dose, with near‐worst‐case (95th percentile) improvements averaging 4.2 %. IPRO‐1C with 9 scenarios, with comparable computational demands as 4DRO, decreased OAR dose by 1.7 %. Conclusions : The use of IPRO could lead to more efficient mitigation of the interplay effect, even when based on the information from a single breathing cycle. This can potentially decrease the need for real‐time motion management techniques that prolong treatment times and decrease patient comfort.

29 July 2014 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
AFAnders Forsgren
Anders Forsgren
TOTove Odland
Tove Odland