An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s40305-013-0031-x / 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/s40305-013-0031-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988419666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a homogeneous algorithm for the monotone complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5453751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementary problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms 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: A polynomial interior-point algorithm for monotone linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization / 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: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477904 / 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: Q4791754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points / 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: An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence / 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: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem / 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: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S40305-013-0031-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:52, 10 December 2024

scientific article
Language Label Description Also known as
English
An adaptive infeasible interior-point algorithm for linear complementarity problems
scientific article

    Statements

    An adaptive infeasible interior-point algorithm for linear complementarity problems (English)
    0 references
    0 references
    0 references
    30 September 2014
    0 references
    linear complementarity problem
    0 references
    infeasible-interior-point-method
    0 references
    central path
    0 references
    polynomial complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers