Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds (Q1029281): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Chih-Jen Lin / rank
Normal rank
 
Property / author
 
Property / author: Stefano Lucidi / rank
Normal rank
 
Property / author
 
Property / author: Laura Palagi / rank
Normal rank
 
Property / author
 
Property / author: Marco Sciandrone / rank
Normal rank
 
Property / author
 
Property / author: Chih-Jen Lin / rank
 
Normal rank
Property / author
 
Property / author: Stefano Lucidi / rank
 
Normal rank
Property / author
 
Property / author: Laura Palagi / rank
 
Normal rank
Property / author
 
Property / author: Marco Sciandrone / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GPDT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SSVM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LIBSVM / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10957-008-9489-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084936896 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60241051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Routing in Capacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multipoint methods for separable nonlinear networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution towards the maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Methods for Massive Support Vector Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semismooth support vector machines. / rank
 
Normal rank
Property / cites work
 
Property / cites work: SSVM: A smooth support vector machine for classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Massive data classification via unconstrained support vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Downlink beamforming for DS-CDMA mobile radio with multimedia services / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergent decomposition algorithm for support vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the working set selection in gradient projection-based decomposition techniques for support vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of a modified version of SVM<i><sup>light</sup></i>algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2755103 / rank
 
Normal rank

Latest revision as of 18:11, 1 July 2024

scientific article
Language Label Description Also known as
English
Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
scientific article

    Statements

    Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 July 2009
    0 references
    large scale optimization
    0 references
    decomposition methods
    0 references
    support vector machines
    0 references
    0 references
    0 references
    0 references

    Identifiers