A Polynomial Method of Weighted Centers for Convex Quadratic Programming (Q3976933): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1080/02522667.1991.10699062 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975279600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A monotonic projective algorithm for fractional linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variation on Karmarkar’s algorithm for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / 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: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimatrix Equilibrium Points and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary Behavior of Interior Point Algorithms in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trajectory-following polynomial-time algorithm for linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\ell_ p\) programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear quadratic programming in oriented matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable dimension algorithm for the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex Method for Quadratic Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:18, 15 May 2024

scientific article
Language Label Description Also known as
English
A Polynomial Method of Weighted Centers for Convex Quadratic Programming
scientific article

    Statements

    A Polynomial Method of Weighted Centers for Convex Quadratic Programming (English)
    0 references
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    weighted trajectories
    0 references
    weighted central path-following method
    0 references
    convex quadratic programming
    0 references
    interior point methods
    0 references
    weighted logarithmic barrier function
    0 references
    0 references