87 citations · 144 across the 11 of their papers we have counts for
11 papers
Developing heuristic solution techniques for large-scale unit commitment models
Nils-Christian Kempke, Tim Kunt, Bassel Katamish +4
Shifting towards renewable energy sources and reducing carbon emissions necessitate sophisticated energy system planning, optimization, and extension. Energy systems optimization m…
A Unified Funnel Restoration SQP Algorithm
David Kiessling, Sven Leyffer, Charlie Vanaret
We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of four algorithmic ingredients that unifies a broad range of nonli…
Implementing a unified solver for nonlinearly constrained optimization
Charlie Vanaret, Sven Leyffer
SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mec…
An Almost Feasible Sequential Linear Programming Algorithm
David Kiessling, Charlie Vanaret, Alejandro Astudillo +2
This paper proposes an almost feasible Sequential Linear Programming (afSLP) algorithm. In the first part, the practical limitations of previously proposed Feasible Sequential Line…
Progress in Mathematical Programming Solvers from 2001 to 2020
Thorsten Koch, Timo Berthold, Jaap Pedersen +1
This study investigates the progress made in LP and MILP solver performance during the last two decades by comparing the solver software from the beginning of the millennium with t…
Interval constraint programming for globally solving catalog-based categorical optimization
Charlie Vanaret
In this article, we propose an interval constraint programming method for globally solving catalog-based categorical optimization problems. It supports catalogs of arbitrary size a…