An interior point method for general large-scale quadratic programming problems (Q1915920): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimizing over three-dimensional subspaces in an interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4308911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5540119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commentary—Interior-Point Methods: Algorithms and Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric indefinite systems for interior point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A long-step barrier method for convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior Newton method for quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polyadic structure of factorable function tensors with applications to high-order minimization techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the big \({\mathcal M}\) in the affine scaling algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A little theorem of the big \({\mathcal M}\) in interior point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Enhancements to the Method of Centers for Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a Dual Affine Interior Point Algorithm for Linear Programming / rank
 
Normal rank

Latest revision as of 12:56, 24 May 2024

scientific article
Language Label Description Also known as
English
An interior point method for general large-scale quadratic programming problems
scientific article

    Statements

    An interior point method for general large-scale quadratic programming problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 July 1996
    0 references
    0 references
    Big-\({\mathcal M}\) Phase I procedure
    0 references
    method of centers
    0 references
    multidirectional search direction
    0 references
    interior point algorithm
    0 references
    nonconvex quadratic programs
    0 references
    cost improvement subproblem
    0 references
    recentering
    0 references