Adaptive constraint reduction for convex quadratic programming (Q434155): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Newton-KKT interior-point methods for indefinite quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Support-vector networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / 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: Q3531415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A potential-reduction variant of Renegar's short-step path-following method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive constraint reduction for training support vector machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3965502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4311922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Reduction for Linear Programs with Many Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An active-set strategy in an interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint-reduced variant of Mehrotra's predictor-corrector algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A ``build-down'' scheme for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Potential Reduction Algorithm Allowing Column Generation / rank
 
Normal rank

Latest revision as of 10:21, 5 July 2024

scientific article
Language Label Description Also known as
English
Adaptive constraint reduction for convex quadratic programming
scientific article

    Statements

    Adaptive constraint reduction for convex quadratic programming (English)
    0 references
    0 references
    0 references
    0 references
    10 July 2012
    0 references
    convex quadratic programming
    0 references
    constraint reduction
    0 references
    column generation
    0 references
    primal-dual interior-point method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers