Oliver Hinder

From MaRDI portal
(Redirected from Oliver Hinder)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The price of adaptivity in stochastic convex optimization
Mathematical Programming. Series A. Series B
2026-09-16Paper
An adaptive interior-point method with backtracking line search for convex constrained optimization
(available as arXiv preprint)
2026-07-14Paper
Asymptotic Lower Bounds for Continuous Optimization
(available as arXiv preprint)
2026-01-01Paper
Optimal diagonal preconditioning
Operations Research
2025-07-17Paper
Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs
Operations Research Letters
2025-05-05Paper
Worst-case iteration bounds for log barrier methods on problems with nonconvex constraints
Mathematics of Operations Research
2025-01-28Paper
PDLP: A Practical First-Order Method for Large-Scale Linear Programming
(available as arXiv preprint)
2025-01-01Paper
A consistently adaptive trust-region method
(available as arXiv preprint)
2024-01-01Paper
A simple and practical adaptive trust-region method
(available as arXiv preprint)
2024-01-01Paper
Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs2023-09-07Paper
Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient2021-06-08Paper
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods
Mathematical Programming. Series A. Series B
2021-02-15Paper
Lower bounds for finding stationary points II: first-order methods
Mathematical Programming. Series A. Series B
2021-01-25Paper
Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient
(available as arXiv preprint)
2021-01-01Paper
Lower bounds for finding stationary points I
Mathematical Programming. Series A. Series B
2020-10-21Paper
A generic adaptive restart scheme with applications to saddle point algorithms2020-06-15Paper
A generic adaptive restart scheme with applications to saddle point algorithms
(available as arXiv preprint)
2020-01-01Paper
Accelerated methods for nonconvex optimization
SIAM Journal on Optimization
2018-07-03Paper
A one-phase interior point method for nonconvex optimization2018-01-09Paper
A one-phase interior point method for nonconvex optimization
(available as arXiv preprint)
2018-01-01Paper
A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
European Journal of Operational Research
2017-12-06Paper
"Convex Until Proven Guilty": Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions2017-05-08Paper
''Convex Until Proven Guilty'': Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions
(available as arXiv preprint)
2017-01-01Paper


Research outcomes over time


This page was built for person: Oliver Hinder