Anders Forsgren
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Anders Forsgren has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- David Ek
Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, Stockholm, Sweden
8 shared publications - Philip E. Gill
UC San Diego
3 shared publications - Tove Odland
Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, Stockholm, Sweden
3 shared publications - Fei Wang
Royal Institute of Technology
2 shared publications - Ivar Bengtsson
Department of Mathematics KTH Royal Institute of Technology Stockholm Sweden
2 shared publications Kjell Eriksson
RaySearch Laboratories AB, Stockholm, Sweden
2 shared publications
Latest Publications
- Open Access
- 13 August 2026
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 14
On the asymptotic behavior of a higher-order extrapolation primal–dual interior-point method for nonlinear programming
- 13 August 2026
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 14
Open AccessOn the asymptotic behavior of a higher-order extrapolation primal–dual interior-point method for nonlinear programming
- Open Access
On the asymptotic behavior of a higher-order extrapolation primal-dual interior-point method for nonlinear programming
A trajectory-following primal--dual interior-point method solves nonlinear optimization problems with inequality and equality constraints by approximately finding points satisfying perturbed Karush--Kuhn--Tucker optimality conditions for a decreasing order of perturbation controlled by the barrier parameter. Under some conditions, there is a unique local correspondence between small residuals of the optimality conditions and points yielding that residual, and the solution on the barrier trajectory for the next barrier parameter can be approximated using an approximate solution for the current parameter. A framework using higher-order derivative information of the correspondence is analyzed in which an extrapolation step to the trajectory is first taken after each decrease of the barrier parameter upon reaching a sufficient approximation. It suffices asymptotically to only take extrapolation steps for convergence at the rate the barrier parameter decreases with when using derivative information of high enough order. Numerical results for quadratic programming problems are presented using extrapolation as accelerator.
Open AccessOn the asymptotic behavior of a higher-order extrapolation primal-dual interior-point method for nonlinear programming
A trajectory-following primal--dual interior-point method solves nonlinear optimization problems with inequality and equality constraints by approximately finding points satisfying perturbed Karush--Kuhn--Tucker optimality conditions for a decreasing order of perturbation controlled by the barrier parameter. Under some conditions, there is a unique local correspondence between small residuals of the optimality conditions and points yielding that residual, and the solution on the barrier trajectory for the next barrier parameter can be approximated using an approximate solution for the current parameter. A framework using higher-order derivative information of the correspondence is analyzed in which an extrapolation step to the trajectory is first taken after each decrease of the barrier parameter upon reaching a sufficient approximation. It suffices asymptotically to only take extrapolation steps for convergence at the rate the barrier parameter decreases with when using derivative information of high enough order. Numerical results for quadratic programming problems are presented using extrapolation as accelerator.
- Open Access
- 11 April 2025
- Published by Wiley in Medical Physics
- Vol. 52 (6) , 3570-3582
Interplay‐robust optimization for treating irregularly breathing lung patients with pencil beam scanning
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.
- 11 April 2025
- Published by Wiley in Medical Physics
- Vol. 52 (6) , 3570-3582
Open AccessInterplay‐robust optimization for treating irregularly breathing lung patients with pencil beam scanning
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.
- Open Access
- 21 February 2025
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 91 (1) , 145-171
Finding search directions in quasi-Newton methods for minimizing a quadratic function subject to uncertainty
We investigate quasi-Newton methods for minimizing a strongly convex quadratic function which is subject to errors in the evaluation of the gradients. In particular, we focus on computing search directions for quasi-Newton methods that all give identical behavior in exact arithmetic, generating minimizers of Krylov subspaces of increasing dimensions, thereby having finite termination. The BFGS quasi-Newton method may be seen as an ideal method in exact arithmetic and is empirically known to behave very well on a quadratic problem subject to small errors. We investigate large-error scenarios, in which the expected behavior is not so clear. We consider memoryless methods that are less expensive than the BFGS method, in that they generate low-rank quasi-Newton matrices that differ from the identity by a symmetric matrix of rank two. In addition, a more advanced model for generating the search directions is proposed, based on solving a chance-constrained optimization problem. Our numerical results indicate that for large errors, such a low-rank memoryless quasi-Newton method may perform better than a BFGS method. In addition, the results indicate a potential edge by including the chance-constrained model in the memoryless quasi-Newton method.
- 21 February 2025
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 91 (1) , 145-171
Open AccessFinding search directions in quasi-Newton methods for minimizing a quadratic function subject to uncertainty
We investigate quasi-Newton methods for minimizing a strongly convex quadratic function which is subject to errors in the evaluation of the gradients. In particular, we focus on computing search directions for quasi-Newton methods that all give identical behavior in exact arithmetic, generating minimizers of Krylov subspaces of increasing dimensions, thereby having finite termination. The BFGS quasi-Newton method may be seen as an ideal method in exact arithmetic and is empirically known to behave very well on a quadratic problem subject to small errors. We investigate large-error scenarios, in which the expected behavior is not so clear. We consider memoryless methods that are less expensive than the BFGS method, in that they generate low-rank quasi-Newton matrices that differ from the identity by a symmetric matrix of rank two. In addition, a more advanced model for generating the search directions is proposed, based on solving a chance-constrained optimization problem. Our numerical results indicate that for large errors, such a low-rank memoryless quasi-Newton method may perform better than a BFGS method. In addition, the results indicate a potential edge by including the chance-constrained model in the memoryless quasi-Newton method.
- 8 November 2024
- Published by Springer Nature
- p. 1-2
Equality-Constrained Nonlinear Programming: KKT Necessary Optimality Conditions
- 8 November 2024
- Published by Springer Nature
- p. 1-2
Equality-Constrained Nonlinear Programming: KKT Necessary Optimality Conditions
- Open Access
- 16 June 2023
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 86 (1) , 1-48
A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming
The focus in this work is on interior-point methods for inequality-constrained quadratic programs, and particularly on the system of nonlinear equations to be solved for each value of the barrier parameter. Newton iterations give high quality solutions, but we are interested in modified Newton systems that are computationally less expensive at the expense of lower quality solutions. We propose a structured modified Newton approach where each modified Jacobian is composed of a previous Jacobian, plus one low-rank update matrix per succeeding iteration. Each update matrix is, for a given rank, chosen such that the distance to the Jacobian at the current iterate is minimized, in both 2-norm and Frobenius norm. The approach is structured in the sense that it preserves the nonzero pattern of the Jacobian. The choice of update matrix is supported by results in an ideal theoretical setting. We also produce numerical results with a basic interior-point implementation to investigate the practical performance within and beyond the theoretical framework. In order to improve performance beyond the theoretical framework, we also motivate and construct two heuristics to be added to the method.
- 16 June 2023
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 86 (1) , 1-48
Open AccessA structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming
The focus in this work is on interior-point methods for inequality-constrained quadratic programs, and particularly on the system of nonlinear equations to be solved for each value of the barrier parameter. Newton iterations give high quality solutions, but we are interested in modified Newton systems that are computationally less expensive at the expense of lower quality solutions. We propose a structured modified Newton approach where each modified Jacobian is composed of a previous Jacobian, plus one low-rank update matrix per succeeding iteration. Each update matrix is, for a given rank, chosen such that the distance to the Jacobian at the current iterate is minimized, in both 2-norm and Frobenius norm. The approach is structured in the sense that it preserves the nonzero pattern of the Jacobian. The choice of update matrix is supported by results in an ideal theoretical setting. We also produce numerical results with a basic interior-point implementation to investigate the practical performance within and beyond the theoretical framework. In order to improve performance beyond the theoretical framework, we also motivate and construct two heuristics to be added to the method.
- Open Access
A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming
The focus in this work is on interior-point methods for inequality-constrained quadratic programs, and particularly on the system of nonlinear equations to be solved for each value of the barrier parameter. Newton iterations give high quality solutions, but we are interested in modified Newton systems that are computationally less expensive at the expense of lower quality solutions. We propose a structured modified Newton approach where each modified Jacobian is composed of a previous Jacobian, plus one low-rank update matrix per succeeding iteration. Each update matrix is, for a given rank, chosen such that the distance to the Jacobian at the current iterate is minimized, in both 2-norm and Frobenius norm. The approach is structured in the sense that it preserves the nonzero pattern of the Jacobian. The choice of update matrix is supported by results in an ideal theoretical setting. We also produce numerical results with a basic interior-point implementation to investigate the practical performance within and beyond the theoretical framework. In order to improve performance beyond the theoretical framework, we also motivate and construct two heuristics to be added to the method.
Open AccessA structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming
The focus in this work is on interior-point methods for inequality-constrained quadratic programs, and particularly on the system of nonlinear equations to be solved for each value of the barrier parameter. Newton iterations give high quality solutions, but we are interested in modified Newton systems that are computationally less expensive at the expense of lower quality solutions. We propose a structured modified Newton approach where each modified Jacobian is composed of a previous Jacobian, plus one low-rank update matrix per succeeding iteration. Each update matrix is, for a given rank, chosen such that the distance to the Jacobian at the current iterate is minimized, in both 2-norm and Frobenius norm. The approach is structured in the sense that it preserves the nonzero pattern of the Jacobian. The choice of update matrix is supported by results in an ideal theoretical setting. We also produce numerical results with a basic interior-point implementation to investigate the practical performance within and beyond the theoretical framework. In order to improve performance beyond the theoretical framework, we also motivate and construct two heuristics to be added to the method.
- Open Access
- 17 April 2023
- Published by IOP Publishing in Physics in Medicine & Biology
- Vol. 68 (9) , 095005
Implications of using the clinical target distribution as voxel-weights in radiation therapy optimization
Objective. Delineating and planning with respect to regions suspected to contain microscopic tumor cells is an inherently uncertain task in radiotherapy. The recently proposed clinical target distribution (CTD) is an alternative to the conventional clinical target volume (CTV), with initial promise. Previously, using the CTD in planning has primarily been evaluated in comparison to a conventionally defined CTV. We propose to compare the CTD approach against CTV margins of various sizes, dependent on the threshold at which the tumor infiltration probability is considered relevant. Approach. First, a theoretical framework is presented, concerned with optimizing the trade-off between the probability of sufficient target coverage and the penalties associated with high dose. From this framework we derive conventional CTV-based planning and contrast it with the CTD approach. The approaches are contextualized further by comparison with established methods for managing geometric uncertainties. Second, for both one- and three-dimensional phantoms, we compare a set of CTD plans created by varying the target objective function weight against a set of plans created by varying both the target weight and the CTV margin size. Main results. The results show that CTD-based planning gives slightly inefficient trade-offs between the evaluation criteria for a case in which near-minimum target dose is the highest priority. However, in a case when sparing a proximal organ at risk is critical, the CTD is better at maintaining sufficiently high dose toward the center of the target. Significance. We conclude that CTD-based planning is a computationally efficient method for planning with respect to delineation uncertainties, but that the inevitable effects on the dose distribution should not be disregarded.
- 17 April 2023
- Published by IOP Publishing in Physics in Medicine & Biology
- Vol. 68 (9) , 095005
Open AccessImplications of using the clinical target distribution as voxel-weights in radiation therapy optimization
Objective. Delineating and planning with respect to regions suspected to contain microscopic tumor cells is an inherently uncertain task in radiotherapy. The recently proposed clinical target distribution (CTD) is an alternative to the conventional clinical target volume (CTV), with initial promise. Previously, using the CTD in planning has primarily been evaluated in comparison to a conventionally defined CTV. We propose to compare the CTD approach against CTV margins of various sizes, dependent on the threshold at which the tumor infiltration probability is considered relevant. Approach. First, a theoretical framework is presented, concerned with optimizing the trade-off between the probability of sufficient target coverage and the penalties associated with high dose. From this framework we derive conventional CTV-based planning and contrast it with the CTD approach. The approaches are contextualized further by comparison with established methods for managing geometric uncertainties. Second, for both one- and three-dimensional phantoms, we compare a set of CTD plans created by varying the target objective function weight against a set of plans created by varying both the target weight and the CTV margin size. Main results. The results show that CTD-based planning gives slightly inefficient trade-offs between the evaluation criteria for a case in which near-minimum target dose is the highest priority. However, in a case when sparing a proximal organ at risk is critical, the CTD is better at maintaining sufficiently high dose toward the center of the target. Significance. We conclude that CTD-based planning is a computationally efficient method for planning with respect to delineation uncertainties, but that the inevitable effects on the dose distribution should not be disregarded.
- Open Access
- 28 April 2021
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 79 (3) , 789-816
Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function
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.
- 28 April 2021
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 79 (3) , 789-816
Open AccessExact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function
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.
- Open Access
An optimization derivation of the method of conjugate gradients
We give a derivation of the method of conjugate gradients based on the requirement that each iterate minimizes a strictly convex quadratic on the space spanned by the previously observed gradients. Rather than verifying that the search direction has the correct properties, we show that generation of such iterates is equivalent to generation of orthogonal gradients which gives the description of the direction and the step length. Our approach gives a straightforward way to see that the search direction of the method of conjugate gradients is a negative scalar times the gradient of minimum Euclidean norm evaluated on the affine span of the iterates generated so far.
Open AccessAn optimization derivation of the method of conjugate gradients
We give a derivation of the method of conjugate gradients based on the requirement that each iterate minimizes a strictly convex quadratic on the space spanned by the previously observed gradients. Rather than verifying that the search direction has the correct properties, we show that generation of such iterates is equivalent to generation of orthogonal gradients which gives the description of the direction and the step length. Our approach gives a straightforward way to see that the search direction of the method of conjugate gradients is a negative scalar times the gradient of minimum Euclidean norm evaluated on the affine span of the iterates generated so far.