Working Paper |
File Downloads |
Abstract Views |

Last month |
3 months |
12 months |
Total |
Last month |
3 months |
12 months |
Total |

A continuous characterization of the maximum-edge biclique problem |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
4 |

A convex formulation for informed source separation in the signle channel setting |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |

A geometric lower bound on the extension complexity of polytopes based on the f-vector |
0 |
0 |
0 |
0 |
0 |
0 |
2 |
4 |

A global-local synthesis approach for large non-regular arrays |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

A multilevel approach for nonnegative matrix factorization |
0 |
0 |
1 |
2 |
0 |
0 |
1 |
23 |

A multilevel approach for nonnegative matrix factorization |
0 |
0 |
0 |
25 |
0 |
0 |
3 |
58 |

ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements |
0 |
0 |
1 |
5 |
0 |
0 |
2 |
27 |

Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization |
0 |
0 |
0 |
4 |
0 |
0 |
0 |
34 |

Accelerated multiplicative updates and hierarchical als algorithms for nonnegative matrix factorization |
0 |
1 |
1 |
18 |
0 |
1 |
4 |
101 |

Algorithms for possible semidefinite factorization |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
11 |

An efficient sampling method for regression-based polynomial chaos expansion |
0 |
0 |
1 |
5 |
0 |
0 |
1 |
36 |

An interior-point method for the single-facility location problem with mixed norms using a conic formulation |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
9 |

An interior-point method for the single-facility location problem with mixed norms using a conic formulation |
0 |
0 |
0 |
19 |
0 |
0 |
0 |
87 |

Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
7 |

Conic formulation for lp-norm optimization |
0 |
0 |
0 |
1 |
0 |
0 |
2 |
19 |

Direct deterministic nulling techniques for large random arrays including mutual coupling |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
10 |

Double smoothing technique for infinite-dimensional optimization problems with applications to optimal control |
1 |
1 |
2 |
25 |
1 |
1 |
2 |
64 |

Double smoothing technique for large-scale linearly constrained convex optimization |
1 |
1 |
3 |
6 |
1 |
1 |
4 |
31 |

Energy limits in primary frequency control with short-term frequency-band allocation |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
12 |

Exact worst-case convergence rates of the proximal gradient method for composite convex minimization |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
21 |

Exact worst-case performance of first-order methods for composite convex optimization |
0 |
0 |
0 |
8 |
0 |
0 |
0 |
51 |

Exact worst-case performance of first-order methods for composite convex optimization |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
20 |

Extended Lanczos Bidiagonalization Algorithm for Low Rank Approximation and Its Applications |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |

Extended formulations for order polytopes through network flows |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
5 |

First-order methods of smooth convex optimization with inexact oracle |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

First-order methods of smooth convex optimization with inexact oracle |
2 |
2 |
3 |
47 |
2 |
2 |
6 |
212 |

First-order methods with inexact oracle: the strongly convex case |
0 |
2 |
6 |
86 |
1 |
6 |
22 |
274 |

Heuristics for Exact Nonnegative Matrix Factorization |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
9 |

Heuristics for exact nonnegative matrix factorization |
0 |
0 |
0 |
18 |
0 |
1 |
1 |
127 |

Image completion via nonnegative matrix factorization using HALS and B-splines |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
10 |

Impact of the material distribution formalism on the efficiency of evolutionary methods for topology optimization |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
10 |

Improving complexity of structured convex optimization problems usiion ng self-concordant barriers |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
11 |

Intermediate gradient methods for smooth convex problems with inexact oracle |
0 |
0 |
1 |
25 |
0 |
1 |
7 |
100 |

Iterative convex approximation bases real-time dynamic spectrum management in multi-user multi-carrier communication systems |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

Les méthodes de point intérieur |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
10 |

Linear convergence of first order methods for non-strongly convex optimization |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
36 |

Low-rank matrix approximation with weights or missing data is NP-hard |
0 |
0 |
0 |
14 |
1 |
2 |
8 |
103 |

Low-rank matrix approximation with weights or missing data is NP-hard |
0 |
0 |
0 |
2 |
0 |
1 |
1 |
19 |

Lower bounds on the nonnegative rank using a nested polytopes formulation |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
6 |

Nonnegative Matrix Factorization over Continuous Signals using Parametrizable Functions |
0 |
0 |
0 |
1 |
0 |
1 |
2 |
14 |

Nonnegative factorization and the maximum edge biclique problem |
0 |
0 |
0 |
20 |
0 |
0 |
2 |
142 |

Nonnegative factorization and the maximum edge biclique problem |
0 |
0 |
1 |
17 |
0 |
2 |
3 |
79 |

On the Worst-case Complexity of the Gradient Method with Exact Line Search for Smooth Strongly Convex Functions |
0 |
0 |
0 |
4 |
0 |
0 |
1 |
28 |

On the geometric interpretation of the nonnegative rank |
0 |
0 |
1 |
7 |
0 |
0 |
2 |
54 |

On the geometric interpretation of the nonnegative rank |
0 |
0 |
0 |
0 |
2 |
2 |
2 |
19 |

On the linear extension complexity of regular n-gons |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |

On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions |
0 |
0 |
0 |
5 |
0 |
0 |
0 |
21 |

On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
17 |

Peak shaving: a planning alternative to reduce investment costs in distribution systems? |
0 |
0 |
0 |
0 |
0 |
0 |
4 |
15 |

Random block coordinate descent methods for linearly constrained optimization over networks |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
16 |

Real-time dynamic spectrum management for multi-user multi-carrier communication systems |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

Smooth Strongly Convex Interpolation and Exact Worst-case Performance of First-order Methods |
0 |
0 |
1 |
4 |
0 |
0 |
1 |
35 |

Smooth strongly convex interpolation and exact worst-case performance of first-order methods |
0 |
0 |
0 |
0 |
1 |
2 |
8 |
31 |

Solving infinite-dimensional optimizaiton problems by polynomial approximation |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
8 |

Solving infinite-dimensional optimization problems by polynomial approximation |
0 |
0 |
2 |
25 |
0 |
0 |
8 |
100 |

Two algorithms for orthogonal nonnegative matrix factorization with application to clusterin |
0 |
0 |
0 |
0 |
2 |
3 |
3 |
3 |

Unsupervised Minimum Redundancy Maximum Relevance Feature Selection for Predictive Maintenance: Application to a Rotating Machine |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
9 |

Using underapproximations for sparse nonnegative matrix factorization |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
15 |

Using underapproximations for sparse nonnegative matrix factorization |
0 |
0 |
0 |
27 |
0 |
0 |
1 |
85 |

Weighted sum rate maximization for downlink OFDMA with subcarrier-pair basded opportunistic DF relaying |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |

Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
6 |

Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation |
0 |
0 |
0 |
2 |
0 |
0 |
1 |
15 |

Total Working Papers |
4 |
7 |
24 |
424 |
11 |
28 |
121 |
2,282 |