Zobrazeno 1 - 10
of 472
pro vyhledávání: '"Olvi L. Mangasarian"'
Autor:
Vandenberghe, Lieven
Publikováno v:
The American Statistician, 2010 Aug 01. 64(3), 270-270.
Externí odkaz:
https://www.jstor.org/stable/20799927
Autor:
Ubeda, Sergio
Publikováno v:
Interfaces, 2009 May 01. 39(3), 295-297.
Externí odkaz:
https://www.jstor.org/stable/25622807
Autor:
Nocedal, Jorge
Publikováno v:
Mathematics of Computation, 1996 Apr 01. 65(214), 884-884.
Externí odkaz:
https://www.jstor.org/stable/2153626
Autor:
McCormick, Garth P.
Publikováno v:
SIAM Review, 1971 Apr 01. 13(2), 240-241.
Externí odkaz:
https://www.jstor.org/stable/2028829
Autor:
Garth P. McCormick
Publikováno v:
SIAM Review. 13:240-241
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
Publikováno v:
SIAM Review; April 1971, Vol. 13 Issue: 2 p240-241, 2p
Autor:
OUEDRAOGO, Dieudonne N.1 douedra1@binghamton.edu
Publikováno v:
Applied Medical Informatics. 2021, Vol. 43 Issue 3, p91-102. 12p.
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
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