A polynomial interior-point algorithm for monotone linear complementarity problems (Q353166): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an 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.1007/s10957-012-0195-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980977181 / 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: On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrector-predictor methods for sufficient linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-regular functions and new search directions for linear and semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP / 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: Q4791754 / 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: Improved infeasible-interior-point algorithm for linear complementarity problerns / 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: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3415802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementary problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:52, 6 July 2024

scientific article
Language Label Description Also known as
English
A polynomial interior-point algorithm for monotone linear complementarity problems
scientific article

    Statements

    A polynomial interior-point algorithm for monotone linear complementarity problems (English)
    0 references
    0 references
    0 references
    12 July 2013
    0 references
    monotone linear complementarity problem (MLCP)
    0 references
    feasible interior-point method
    0 references
    central path
    0 references
    polynomial complexity
    0 references

    Identifiers