Sciweavers

MP
2016
10 years 25 days ago
Spectral simplex method
We develop an iterative optimization method for nding the maximal and minimal spectral radius of a matrix over a compact set of nonnegative matrices. We consider matrix sets with...
Vladimir Yu. Protasov
MP
2016
10 years 25 days ago
Continuous knapsack sets with divisible capacities
We study two continuous knapsack sets Y≥ and Y≤ with n integer, one unbounded continuous and m bounded continuous variables in either ≥ or ≤ form. When the coefficients of...
Laurence A. Wolsey, Hande Yaman
113
Voted
MP
2016
10 years 25 days ago
A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
We propose an efficient computational method for linearly constrained quadratic optimization problems (QOPs) with complementarity constraints based on their Lagrangian and doubly ...
Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh
MP
2016
10 years 25 days ago
New analysis and results for the Frank-Wolfe method
We present new results for the Frank-Wolfe method (also known as the conditional gradient method). We derive computational guarantees for arbitrary step-size sequences, which are ...
Robert M. Freund, Paul Grigas