53 citations · 178 across the 24 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.OC2018★ 5 cited
Worst-case iteration bounds for log barrier methods on problems with nonconvex constraints
Oliver Hinder, Yinyu Ye
Interior point methods (IPMs) that handle nonconvex constraints such as IPOPT, KNITRO and LOQO have had enormous practical success. We consider IPMs in the setting where the object…
math.OC2018★ 3 cited
Cutting plane methods can be extended into nonconvex optimization
Oliver Hinder
We show that it is possible to obtain an expected runtime --- including computational cost --- for finding -stationary points of smooth nonconvex functions using c…
math.OC2018★ 10 cited
A one-phase interior point method for nonconvex optimization
Oliver Hinder, Yinyu Ye
The work of Wachter and Biegler suggests that infeasible-start interior point methods (IPMs) developed for linear programming cannot be adapted to nonlinear optimization without si…