62 citations · 227 across the 33 of their papers we have counts for
4 papers · 1 filter
Certificates of infeasibility via nonsmooth optimization
Hannes Fendl, Arnold Neumaier, Hermann Schichl
An important aspect in the solution process of constraint satisfaction problems is to identify exclusion boxes which are boxes that do not contain feasible points. This paper prese…
An optimal subgradient algorithm for large-scale bound-constrained convex optimization
Masoud Ahookhosh, Arnold Neumaier
This paper shows that the OSGA algorithm -- which uses first-order information to solve convex optimization problems with optimal complexity -- can be used to efficiently solve arb…
An optimal subgradient algorithm for large-scale convex optimization in simple domains
Masoud Ahookhosh, Arnold Neumaier
This paper shows that the optimal subgradient algorithm, OSGA, proposed in \cite{NeuO} can be used for solving structured large-scale convex constrained optimization problems. Only…
OSGA: A fast subgradient algorithm with optimal complexity
Arnold Neumaier
This paper presents an algorithm for approximately minimizing a convex function in simple, not necessarily bounded convex domains, assuming only that function values and subgradien…