3 papers
math.OC2026
An adaptive interior-point method with backtracking line search for convex constrained optimization
Fadi Hamad, Oliver Hinder
Interior-point methods (IPMs) are widely adopted due to their high practical efficiency in solving linear, convex, and nonconvex optimization problems. For convex optimization, thi…
math.OC2024
A simple and practical adaptive trust-region method
Fadi Hamad, Oliver Hinder
We present an adaptive trust-region method for unconstrained optimization that allows inexact solutions to the trust-region subproblems. Our method is a simple variant of the class…
math.OC2024
A consistently adaptive trust-region method
Fadi Hamad, Oliver Hinder
Adaptive trust-region methods attempt to maintain strong convergence guarantees without depending on conservative estimates of problem properties such as Lipschitz constants. Howev…