Mina Saee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mina Saee has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- João Gouveia
CMUC, Department of Mathematics, University of Coimbra, Coimbra, Portugal
3 shared publications - Ali Moghanni Dehkharghani2 shared publications
- Javad Mehri-Tekmeh
Dept. Applied Mathematics, Faculty of Mathematics. University of Tabriz
2 shared publications - Ting Kei Pong
Department of Applied Mathematics The Hong Kong Polytechnic University Hong Kong China
2 shared publications - Alexander Kovačec
University of Coimbra
1 shared publication Mirkamal Mirnia
1 shared publication
Latest Publications
- Open Access
On sums of squares of $k$-nomials
In 2005, Boman et al introduced the concept of factor width for a real symmetric positive semidefinite matrix. This is the smallest positive integer $k$ for which the matrix $A$ can be written as $A=VV^T$ with each column of $V$ containing at most $k$ non-zeros. The cones of matrices of bounded factor width give a hierarchy of inner approximations to the PSD cone. In the polynomial optimization context, a Gram matrix of a polynomial having factor width $k$ corresponds to the polynomial being a sum of squares of polynomials of support at most $k$. Recently, Ahmadi and Majumdar, explored this connection for case $k=2$ and proposed to relax the reliance on sum of squares polynomials in semidefinite programming to sum of binomial squares polynomials (sobs; which they call sdsos), for which semidefinite programming can be reduced to second order programming to gain scalability at the cost of some tolerable loss of precision. With this they tap into the study of sobs that goes back to Reznick and Hurwitz. In this paper, we will prove some results on the geometry of the cones of matrices with bounded factor widths and their duals, and use them to derive new results on the limitations of certificates of nonnegativity of quadratic forms by sums of $k$-nomial squares using standard multipliers. In particular we will show that they never help for symmetric quadratics, for any quadratic if $k=2$, and any quaternary quadratic if $k=3$. Furthermore we give some evidence that those are a complete list of such cases.Open AccessOn sums of squares of $k$-nomials
In 2005, Boman et al introduced the concept of factor width for a real symmetric positive semidefinite matrix. This is the smallest positive integer $k$ for which the matrix $A$ can be written as $A=VV^T$ with each column of $V$ containing at most $k$ non-zeros. The cones of matrices of bounded factor width give a hierarchy of inner approximations to the PSD cone. In the polynomial optimization context, a Gram matrix of a polynomial having factor width $k$ corresponds to the polynomial being a sum of squares of polynomials of support at most $k$. Recently, Ahmadi and Majumdar, explored this connection for case $k=2$ and proposed to relax the reliance on sum of squares polynomials in semidefinite programming to sum of binomial squares polynomials (sobs; which they call sdsos), for which semidefinite programming can be reduced to second order programming to gain scalability at the cost of some tolerable loss of precision. With this they tap into the study of sobs that goes back to Reznick and Hurwitz. In this paper, we will prove some results on the geometry of the cones of matrices with bounded factor widths and their duals, and use them to derive new results on the limitations of certificates of nonnegativity of quadratic forms by sums of $k$-nomial squares using standard multipliers. In particular we will show that they never help for symmetric quadratics, for any quadratic if $k=2$, and any quaternary quadratic if $k=3$. Furthermore we give some evidence that those are a complete list of such cases. - 3 December 2019
- Published by Springer Nature in Journal of Global Optimization
- Vol. 76 (2) , 383-405
Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
- 3 December 2019
- Published by Springer Nature in Journal of Global Optimization
- Vol. 76 (2) , 383-405
Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
- Open Access
Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
Motivated by the expressive power of completely positive programming to encode hard optimization problems, many approximation schemes for the completely positive cone have been proposed and successfully used. Most schemes are based on outer approximations, with the only inner approximations available being linear programming based methods proposed by Bundfuss and D\"ur and also Y{\i}ld{\i}r{\i}m, and a semidefinite programming based method proposed by Lasserre. In this paper, we propose the use of the cone of nonnegative scaled diagonally dominant matrices as a natural inner approximation to the completely positive cone. Using projections of this cone we derive new graph-based second-order cone approximation schemes for completely positive programming, leading to both uniform and problem-dependent hierarchies. This offers a compromise between the expressive power of semidefinite programming and the speed of linear programming based approaches. Numerical results on random problems, standard quadratic programs and the stable set problem are presented to illustrate the effectiveness of our approach.
Open AccessInner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
Motivated by the expressive power of completely positive programming to encode hard optimization problems, many approximation schemes for the completely positive cone have been proposed and successfully used. Most schemes are based on outer approximations, with the only inner approximations available being linear programming based methods proposed by Bundfuss and D\"ur and also Y{\i}ld{\i}r{\i}m, and a semidefinite programming based method proposed by Lasserre. In this paper, we propose the use of the cone of nonnegative scaled diagonally dominant matrices as a natural inner approximation to the completely positive cone. Using projections of this cone we derive new graph-based second-order cone approximation schemes for completely positive programming, leading to both uniform and problem-dependent hierarchies. This offers a compromise between the expressive power of semidefinite programming and the speed of linear programming based approaches. Numerical results on random problems, standard quadratic programs and the stable set problem are presented to illustrate the effectiveness of our approach.
- Open Access
- 29 May 2013
- Published by AccScience Publishing in An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
- Vol. 3 (2) , 153-159
The system optimization perspective for multiproduct supply chain network
In this paper, multiproduct supply chain network model is developed with system opti-mization perspective. Each kind of products has an individual cost function and, at the same time,contributes to its own and other product's cost function in an individual way. The well-known equi-librium algorithm is extended to nd system optimization pattern for such multiproduct supply chainnetwork.
- 29 May 2013
- Published by AccScience Publishing in An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
- Vol. 3 (2) , 153-159
Open AccessThe system optimization perspective for multiproduct supply chain network
In this paper, multiproduct supply chain network model is developed with system opti-mization perspective. Each kind of products has an individual cost function and, at the same time,contributes to its own and other product's cost function in an individual way. The well-known equi-librium algorithm is extended to nd system optimization pattern for such multiproduct supply chainnetwork.
- Open Access
- 9 September 2012
- Published by AccScience Publishing in An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
- Vol. 3 (1) , 65-71
Equity in multiproduct supply chain network
In this paper, multiproduct supply chain network is investigated with equity consideration,namely, obtaining the optimal flow pattern, in such a way that no user in the network can increasehis(her) benefit with change in product’s sending path. However, each kind of products, has anindividual cost function and, at the same time, contributes to its own and other product’s cost functionin an individual way. An algorithm is developed to find optimal flow pattern for such multiproductsupply chain network.
- 9 September 2012
- Published by AccScience Publishing in An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
- Vol. 3 (1) , 65-71
Open AccessEquity in multiproduct supply chain network
In this paper, multiproduct supply chain network is investigated with equity consideration,namely, obtaining the optimal flow pattern, in such a way that no user in the network can increasehis(her) benefit with change in product’s sending path. However, each kind of products, has anindividual cost function and, at the same time, contributes to its own and other product’s cost functionin an individual way. An algorithm is developed to find optimal flow pattern for such multiproductsupply chain network.