David Kiessling

Papers

Total Citations

H-Index

About

David Kiessling is a researcher specializing in optimization algorithms, with a particular focus on feasible sequential linear programming (FSLP) and acceleration techniques. His most notable contribution is the development of the Anderson Accelerated Feasible Sequential Linear Programming (AA(d)-FSLP) algorithm, which significantly enhances the efficiency of FSLP by incorporating Anderson acceleration. This method preserves feasibility across all intermediate iterates—a critical advantage for constrained optimization problems—while reducing the number of iterations required for convergence. Kiessling’s work bridges theoretical rigor and practical application, offering a robust tool for fields like engineering design and operations research where maintaining feasible solutions is paramount. Though his 2023 paper has garnered 2 citations to date, its impact lies in its innovative approach to accelerating a well-established optimization framework. Kiessling’s research is particularly valuable for students and practitioners seeking efficient, reliable methods for solving complex, constraint-heavy problems. His contributions underscore a commitment to advancing computational optimization, making him a promising figure in the field.