Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy
From MaRDI portal
Publication:5067430
Abstract: Auxiliary variables are often used to model a convex piecewise linear function in the framework of linear optimization. This work shows that such variables yield a block diagonal plus low rank structure in the reduced KKT system of the dual problem. We show how the structure can be detected efficiently, and derive the linear algebra formulas for an interior point method which exploit such structure. The structure is detected in 36% of the cases in Netlib. Numerical results on the inverse planning problem in radiation therapy show an order of magnitude speed-up compared to the state-of-the-art interior point solver CPLEX, and considerable improvements in dose distribution compared to current algorithms.
Recommendations
- An interior-point implementation developed and tuned for radiation therapy treatment planning
- A convex optimization approach to radiation treatment planning with dose constraints
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- Radiation therapy treatment planning: An \(\mathcal L^ 2\) approach
- A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems
- scientific article; zbMATH DE number 1889340
- Interior-point methods for convex programming
- scientific article; zbMATH DE number 1047680
- On linear infeasibility arising in intensity-modulated radiation therapy inverse planning
- A Practical Interior-Point Method for Convex Programming
Cites work
- A brief history of linear and mixed-integer programming computation
- A Modeling Language for Mathematical Programming
- A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems
- A Structure-Exploiting Tool in Algebraic Modeling Languages
- Algorithm 778: L-BFGS-B
- An interior-point implementation developed and tuned for radiation therapy treatment planning
- Enlargement Methods for Computing the Inverse Matrix
- Exploiting structure in parallel implementation of interior point methods for optimization
- Further development of multiple centrality correctors for interior point methods
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Interior-point solver for convex separable block-angular problems
- LOQO:an interior point code for quadratic programming
- Multi-criteria optimization and decision-making in radiotherapy
- Multiple centrality corrections in a primal-dual method for linear programming
- On the Implementation of a Primal-Dual Interior Point Method
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimal estimation of executive compensation by linear programming
- Optimizing the Delivery of Radiation Therapy to Cancer Patients
- Parallel interior-point solver for structured linear programs
- Real-Time Radiation Treatment Planning with Optimality Guarantees via Cluster and Bound Methods
- Reducibility among combinatorial problems
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- The Price of Robustness
- Using an interior point method for the master problem in a decomposition approach
- Using eigenstructure of the Hessian to reduce the dimension of the intensity modulated radiation therapy optimization problem
Cited in
(1)
This page was built for publication: Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5067430)
