Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
A significant amount of the computational time in large Monte Carlo simulations of lattice field theory is spent inverting the discrete Dirac operator. Unfortunately, traditional...
James J. Brannick, C. Ketelsen, Thomas A. Manteuff...
We present a new "hp" parameter multi-domain certified reduced basis method for rapid and reliable online evaluation of functional outputs associated with parametrized el...
Jens L. Eftang, Anthony T. Patera, Einar M. R&osla...
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
James Hernandez, Zachary T. Harmany, Daniel Thomps...