#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2014

2018

- This year (4)
- Last 5 years (20)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ramtin Madani, Morteza Ashraphijuo, Javad Lavaei
- IEEE Transactions on Power Systems
- 2014

This paper is concerned with the security-constrained optimal power flow (SCOPF) problem, where each contingency corresponds to the outage of an arbitrary number of lines and generators. The problemâ€¦ (More)

- Ramtin Madani, Morteza Ashraphijuo, Javad Lavaei, Ross Baldick
- 2016 IEEE 55th Conference on Decision and Controlâ€¦
- 2016

This paper is concerned with the power system state estimation (PSSE) problem, which aims to find the unknown operating point of a power network based on a given set of measurements. The measurementsâ€¦ (More)

- Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang
- ArXiv
- 2016

We investigate the fundamental conditions on the sampling pattern, i.e., locations of the sampled entries, for finite completability of a low-rank tensor given some components of its Tucker rank. Inâ€¦ (More)

- Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang
- 2017 IEEE International Symposium on Informationâ€¦
- 2017

In this paper, we characterize the deterministic conditions on the locations of the sampled entries, which are equivalent (necessary and sufficient) to finite completability of a tensor given someâ€¦ (More)

- Morteza Ashraphijuo, Xiaodong Wang
- Journal of Machine Learning Research
- 2017

We consider the problem of low canonical polyadic (CP) rank tensor completion. A completion is a tensor whose entries agree with the observed entries and its rank matches the given CP rank. Weâ€¦ (More)

- Morteza Ashraphijuo, Ramtin Madani, Javad Lavaei
- 2016 IEEE 55th Conference on Decision and Controlâ€¦
- 2016

In this paper, the rank-constrained matrix feasibility problem is considered, where an unknown positive semidefinite (PSD) matrix is to be found based on a set of linear specifications. First, weâ€¦ (More)

- Morteza Ashraphijuo, Xiaodong Wang, Vaneet Aggarwal
- ArXiv
- 2017

We consider the multi-view data completion problem, i.e., to complete a matrix U = [U1|U2] where the ranks of U,U1, and U2 are given. In particular, we investigate the fundamental conditions on theâ€¦ (More)

- Morteza Ashraphijuo, Xiaodong Wang, Vaneet Aggarwal
- 2017 IEEE International Symposium on Informationâ€¦
- 2017

In this paper, we consider the problem of completing a sampled matrix U = [U1|U2] given the ranks of U, U1, and U2 which is known as the multi-view data completion problem. We characterize theâ€¦ (More)

- Morteza Ashraphijuo, Ramtin Madani, Javad Lavaei
- 2015 54th IEEE Conference on Decision and Controlâ€¦
- 2015

This paper is concerned with obtaining the inverse of polynomial functions using semidefinite programming (SDP). Given a polynomial function and a nominal point at which the Jacobian of the functionâ€¦ (More)

The unit commitment (UC) problem aims to find an optimal schedule of generating units subject to demand and operating constraints for an electricity grid. The majority of existing algorithms for theâ€¦ (More)