메뉴 건너뛰기




Volumn 48, Issue 4, 2010, Pages 657-669

DC models for spherical separation

Author keywords

DC functions; DCA; Spherical separation

Indexed keywords

DATA SETS; DC FUNCTIONS; DC MODEL; DCA; ERROR FUNCTION; NON-DIFFERENTIABLE; NONCONVEX; NUMERICAL RESULTS; SPHERICAL SEPARATION;

EID: 78149283059     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-010-9558-0     Document Type: Article
Times cited : (37)

References (20)
  • 1
    • 15244346000 scopus 로고    scopus 로고
    • The DC (Difference of Convex Functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
    • 10.1007/s10479-004-5022-1
    • L.T.H. An P.D. Tao 2005 The DC (Difference of Convex Functions) programming and DCA revisited with DC models of real world nonconvex optimization problems Ann. Oper. Res. 133 23 46 10.1007/s10479-004-5022-1
    • (2005) Ann. Oper. Res. , vol.133 , pp. 23-46
    • An, L.T.H.1    Tao, P.D.2
  • 2
    • 0036117125 scopus 로고    scopus 로고
    • Polyhedral separability through successive LP
    • 10.1023/A:1013649822153
    • A. Astorino M. Gaudioso 2002 Polyhedral separability through successive LP J. Optim. Theory Appl. 112 265 293 10.1023/A:1013649822153
    • (2002) J. Optim. Theory Appl. , vol.112 , pp. 265-293
    • Astorino, A.1    Gaudioso, M.2
  • 3
    • 12444319335 scopus 로고    scopus 로고
    • Ellipsoidal separation for classification problems
    • 10.1080/10556780512331318254
    • A. Astorino M. Gaudioso 2005 Ellipsoidal separation for classification problems Optim. Methods Softw. 20 261 270 10.1080/10556780512331318254
    • (2005) Optim. Methods Softw. , vol.20 , pp. 261-270
    • Astorino, A.1    Gaudioso, M.2
  • 4
    • 67650177451 scopus 로고    scopus 로고
    • A fixed-center spherical separation algorithm with kernel transformations for classification problems
    • 10.1007/s10287-007-0051-2
    • A. Astorino M. Gaudioso 2009 A fixed-center spherical separation algorithm with kernel transformations for classification problems Computat. Manage. Sci. 6 357 372 10.1007/s10287-007-0051-2
    • (2009) Computat. Manage. Sci. , vol.6 , pp. 357-372
    • Astorino, A.1    Gaudioso, M.2
  • 7
    • 4043148628 scopus 로고    scopus 로고
    • Minimizing nonconvex nonsmooth functions via cutting planes and proximity control
    • 10.1137/S1052623402411459
    • A. Fuduli M. Gaudioso G. Giallombardo 2004 Minimizing nonconvex nonsmooth functions via cutting planes and proximity control SIAM J. Optim. 14 743 756 10.1137/S1052623402411459
    • (2004) SIAM J. Optim. , vol.14 , pp. 743-756
    • Fuduli, A.1    Gaudioso, M.2    Giallombardo, G.3
  • 8
    • 0035789613 scopus 로고    scopus 로고
    • Proximal support vector machine classifiers
    • San Francisco
    • Fung, G., Mangasarian, O.L.: Proximal support vector machine classifiers. in Proceedings KDD-2001, pp. 77-86. San Francisco (2001)
    • (2001) Proceedings KDD-2001 , pp. 77-86
    • Fung, G.1    Mangasarian, O.L.2
  • 9
    • 0000963583 scopus 로고
    • Linear and nonlinear separation of patterns by linear programming
    • 10.1287/opre.13.3.444
    • O. Mangasarian 1965 Linear and nonlinear separation of patterns by linear programming Oper. Res. 13 444 452 10.1287/opre.13.3.444
    • (1965) Oper. Res. , vol.13 , pp. 444-452
    • Mangasarian, O.1
  • 10
    • 0347512512 scopus 로고    scopus 로고
    • Lagrangian support vector machines
    • 10.1162/15324430152748218
    • O.L. Mangasarian D.R. Musicant 2001 Lagrangian support vector machines J. Mach. Learn. Res. 1 161 177 10.1162/15324430152748218
    • (2001) J. Mach. Learn. Res. , vol.1 , pp. 161-177
    • Mangasarian, O.L.1    Musicant, D.R.2
  • 12
    • 0001412271 scopus 로고
    • Pattern separation by convex programming
    • 10.1016/0022-247X(65)90150-2
    • J.B. Rosen 1965 Pattern separation by convex programming J. Math. Anal. Appl. 10 123 134 10.1016/0022-247X(65)90150-2
    • (1965) J. Math. Anal. Appl. , vol.10 , pp. 123-134
    • Rosen, J.B.1
  • 17
    • 0032081028 scopus 로고    scopus 로고
    • A D.C. optimization algorithm for solving the trust-region subproblem
    • 10.1137/S1052623494274313
    • P.D. Tao L.T.H. An 1998 A D.C. optimization algorithm for solving the trust-region subproblem SIAM J. Con. Opt. 8 476 505 10.1137/S1052623494274313
    • (1998) SIAM J. Con. Opt. , vol.8 , pp. 476-505
    • Tao, P.D.1    An, L.T.H.2
  • 18
    • 0001986205 scopus 로고    scopus 로고
    • Data domain description using support vectors
    • Belgium
    • Tax, D.M.J., Duin, R.P.W.: Data domain description using support vectors. In: ESANN'1999 proceedings Bruges, pp. 251-256. Belgium (1999)
    • (1999) ESANN'1999 Proceedings Bruges , pp. 251-256
    • Tax, D.M.J.1    Duin, R.P.W.2
  • 19
    • 0013372968 scopus 로고    scopus 로고
    • Uniform object generation for optimizing one-class classifiers
    • 10.1162/15324430260185583
    • D.M.J. Tax R.P.W. Duin 2001 Uniform object generation for optimizing one-class classifiers J. Mach. Learn. Res. 2 155 173 10.1162/15324430260185583
    • (2001) J. Mach. Learn. Res. , vol.2 , pp. 155-173
    • Tax, D.M.J.1    Duin, R.P.W.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.