An efficient logarithmic barrier method without line search for convex quadratic programming (Q5882851): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm and separating method for the optimisation of quadratic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new penalty function algorithm for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical feasible interior point method for linear semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalty method for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logarithm barrier method for semi-definite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / 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: Logarithmic Barrier Method Via Minorant Function for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logarithmic barrier approach for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex Method for Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for eigenvalues using traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming / rank
 
Normal rank

Latest revision as of 18:58, 31 July 2024

scientific article; zbMATH DE number 7668672
Language Label Description Also known as
English
An efficient logarithmic barrier method without line search for convex quadratic programming
scientific article; zbMATH DE number 7668672

    Statements

    An efficient logarithmic barrier method without line search for convex quadratic programming (English)
    0 references
    0 references
    0 references
    29 March 2023
    0 references
    quadratic programming
    0 references
    linear programming
    0 references
    interior point methods
    0 references
    line search
    0 references
    approximate function
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references