Login / Signup
A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints.
Sergei Chubanov
Published in:
SIAM J. Optim. (2016)
Keyphrases
</>
linear constraints
cost function
objective function
sensitivity analysis
linearly constrained
lower bound
optimization problems
bit rate