Zobrazeno 1 - 10
of 186
pro vyhledávání: '"Olvi L. Mangasarian"'
Autor:
Olvi L. Mangasarian
Publikováno v:
Optimization Letters. 11:1469-1475
We give linear-inequalities-based sufficient conditions for the unsolvability and solvability of the NP-hard absolute value equation: \(Ax-|x|=b\), where A is an \(n\times n\) square matrix. The satisfaction of the linear inequalities is easily verif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d21a4d87c43fdd9925a3aa7b6c86cb9
https://doi.org/10.1007/s11590-017-1115-z
https://doi.org/10.1007/s11590-017-1115-z
Autor:
Olvi L. Mangasarian, Glenn Fung
Publikováno v:
Journal of Optimization Theory and Applications. 168:551-558
We consider the problem of classifying completely or partially unlabeled data by using inequalities that contain absolute values of the data. This allows each data point to belong to either one of two classes by entering the inequality with a plus or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f975cbea0f999e1dbb1fb42fc3c1f8a
https://doi.org/10.1007/s10957-015-0818-5
https://doi.org/10.1007/s10957-015-0818-5
Autor:
Olvi L. Mangasarian
Publikováno v:
Optimization Letters. 9:1469-1474
We propose a hybrid algorithm for solving the NP-hard absolute value equation (AVE): \(Ax-|x|=b\), where \(A\) is an \(n\times n\) square matrix. The algorithm makes no assumptions on the AVE other than solvability and consists of solving iteratively
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d5858b57ef3fbc012615a107ad96e4e
https://doi.org/10.1007/s11590-015-0893-4
https://doi.org/10.1007/s11590-015-0893-4
Autor:
Olvi L. Mangasarian
Publikováno v:
Optimization. 64:81-86
We consider the problem of classifying completely unlabelled data using convex inequalities that contain absolute values of the data. This allows each data point to belong to either one of two classes by entering the inequality with a plus or minus v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77375c71b0dc60af5844d75c12223ce8
https://doi.org/10.1080/02331934.2014.947501
https://doi.org/10.1080/02331934.2014.947501
Autor:
Olvi L. Mangasarian
Publikováno v:
Journal of Optimization Theory and Applications. 161:870-876
By utilizing a dual complementarity property, we propose a new linear programming method for solving the NP-hard absolute value equation (AVE): Ax?|x|=b, where A is an n×n square matrix. The algorithm makes no assumptions on the AVE other than solva
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::71df8eeb401760576d147adc75c147f9
https://doi.org/10.1007/s10957-013-0461-y
https://doi.org/10.1007/s10957-013-0461-y
Autor:
Olvi L. Mangasarian
Publikováno v:
Optimization Letters. 8:1529-1534
We consider the linear complementarity problem (LCP): $$Mz+q\ge 0, z\ge 0, z^{\prime }(Mz+q)=0$$ as an absolute value equation (AVE): $$(M+I)z+q=|(M-I)z+q|$$ , where $$M$$ is an $$n\times n$$ square matrix and $$I$$ is the identity matrix. We propose
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::506972c80d4ede3de0a19a89e7a963fe
https://doi.org/10.1007/s11590-013-0656-z
https://doi.org/10.1007/s11590-013-0656-z
Autor:
Olvi L. Mangasarian, GlennM. Fung
Publikováno v:
Optimization Methods and Software. 28:207-216
We propose a novel privacy-preserving random kernel approximation based on a data matrix A ∈ R m × n whose rows are divided into privately owned blocks. Each block of rows belongs to a different entity that is unwilling to share its rows or make t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::731b27a0a56862c447efe5f887c09e5b
https://doi.org/10.1080/10556788.2012.710615
https://doi.org/10.1080/10556788.2012.710615
Autor:
Olvi L. Mangasarian
Publikováno v:
Optimization Letters. 7:625-630
By utilizing a dual complementarity condition, we propose an iterative method for solving the NP-hard absolute value equation (AVE): Ax − |x| = b, where A is an n × n square matrix. The algorithm makes no assumptions on the AVE other than solvabil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f47c6551b86e710b797c944a08b17ce7
https://doi.org/10.1007/s11590-012-0469-5
https://doi.org/10.1007/s11590-012-0469-5
Autor:
Benjamin Recht, Olvi L. Mangasarian
Publikováno v:
European Journal of Operational Research. 214:27-30
We consider a system of m linear equations in n variables Ax = d and give necessary and sufficient conditions for the existence of a unique solution to the system that is integer: x ∈ {−1, 1}n. We achieve this by reformulating the problem as a li
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::739f161fa0f21698a291d7a8f9add68c
https://doi.org/10.1016/j.ejor.2011.04.010
https://doi.org/10.1016/j.ejor.2011.04.010
Autor:
Glenn Fung, Olvi L. Mangasarian
Publikováno v:
Journal of Optimization Theory and Applications. 151:1-10
For a bounded system of linear equalities and inequalities, we show that the NP-hard l0-norm minimization problem is completely equivalent to the concave lp-norm minimization problem, for a sufficiently small p. A local solution to the latter problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2d3a740cc37bd5f2b08095b244b5af4
https://doi.org/10.1007/s10957-011-9871-x
https://doi.org/10.1007/s10957-011-9871-x