A combined homotopy interior point method for the linear complementarity problem (Q849782): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2005.12.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029939209 / 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 quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP / 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: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infeasible-interior-point algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined homotopy interior point method for general nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined homotopy interior point method for convex nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The aggregate constraint homotopy method for nonconvex nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5866869 / rank
 
Normal rank

Latest revision as of 22:37, 24 June 2024

scientific article
Language Label Description Also known as
English
A combined homotopy interior point method for the linear complementarity problem
scientific article

    Statements

    A combined homotopy interior point method for the linear complementarity problem (English)
    0 references
    0 references
    0 references
    0 references
    31 October 2006
    0 references
    The authors propose a homotopy interior point algorithm for the linear programming complementarity problem. Starting from any interior point, it follows a smooth homotopy path to reaching the solution by using a predictor-corrector technique. Convergence properties are discussed and a numerical example is given.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    homotopy path
    0 references
    predictor-corrector algorithm
    0 references
    interior point algorithm
    0 references
    convergence
    0 references
    numerical example
    0 references
    0 references