complexity analysis 1convex optimization 1interior-point methods 1line search 1log barrier 1regularized Newton 1
From the 1 of 2 linked papers with an AI index.
Showing math.OCShow all
3 papers · 1 filter
math.OC2026
An adaptive interior-point method with backtracking line search for convex constrained optimization
Fadi Hamad, Oliver Hinder
The paper proposes and analyzes an adaptive interior‑point algorithm that uses a regularized Newton step with backtracking line search on a log‑barrier function to solve convex pro…
math.OC2025
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…