Interior-point methods for nonlinear complementarity problems (Q1918290): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On the classical logarithmic barrier function method for a class of smooth convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence behavior of interior-point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite convergence of interior-point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopy Continuation Methods for Nonlinear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new continuation method for complementarity problems with uniform P- functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems / 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: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some efficient interior point methods for nonlinear convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02192201 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061027379 / rank
 
Normal rank

Latest revision as of 11:11, 30 July 2024

scientific article
Language Label Description Also known as
English
Interior-point methods for nonlinear complementarity problems
scientific article

    Statements

    Interior-point methods for nonlinear complementarity problems (English)
    0 references
    0 references
    0 references
    31 July 1996
    0 references
    convergence rates
    0 references
    potential reduction interior-point algorithm
    0 references
    monotone nonlinear complementarity
    0 references
    0 references
    0 references
    0 references

    Identifiers