Two new decomposition algorithms for training bound-constrained support vector machines (Q275574): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Support-vector networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Object-oriented software for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple decomposition method for support vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-plane training of structural SVMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse kernel SVMs via cutting-plane training / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/15324430152748218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pegasos: primal estimated sub-gradient solver for SVM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization theory and methods. Nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093401 / rank
 
Normal rank

Latest revision as of 20:27, 11 July 2024

scientific article
Language Label Description Also known as
English
Two new decomposition algorithms for training bound-constrained support vector machines
scientific article

    Statements

    Two new decomposition algorithms for training bound-constrained support vector machines (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2016
    0 references
    decomposition algorithm
    0 references
    support vector machine
    0 references
    quadratic programming
    0 references
    global convergence
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references