A new class of infeasible interior-point algorithm for linear complementarity problem (Q5400131): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11859-013-0923-y / rank
Normal rank
 
Property / author
 
Property / author: Xian-Jia Wang / rank
Normal rank
 
Property / author
 
Property / author: Xian-Jia Wang / 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/s11859-013-0923-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988776931 / 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: Q2773659 / rank
 
Normal rank
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: A primal-dual infeasible-interior-point algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility issues in a primal-dual interior-point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomiality of infeasible-interior-point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified<i>O</i>(<i>nL</i>) infeasible interior-point algorithm for linear optimization using full-Newton steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible interior-point algorithm with full-Newton step for linear optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11859-013-0923-Y / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:54, 30 December 2024

scientific article; zbMATH DE number 6263953
Language Label Description Also known as
English
A new class of infeasible interior-point algorithm for linear complementarity problem
scientific article; zbMATH DE number 6263953

    Statements

    A new class of infeasible interior-point algorithm for linear complementarity problem (English)
    0 references
    0 references
    0 references
    0 references
    28 February 2014
    0 references
    linear complementarity problem
    0 references
    infeasible interior-point method
    0 references
    full-Newton step
    0 references
    polynomial complexity
    0 references

    Identifiers