Numerical comparisons of two effective methods for mixed complementarity problems (Q966077): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering and Economic Applications of Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of large scale mixed complementarity problem solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: QPCOMP: A quadratic programming based solver for mixed complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible descent algorithms for mixed complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strictly feasible equation-based methods for mixed complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a semismooth least squares formulation of complementarity problems with gap reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact QP-based method for nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Methods for Nonlinear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NE/SQP: A robust algorithm for the nonlinear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of NCP functions and a descent method for the nonlinear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth Equations: Motivation and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth version of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of monotone complementarity problems with locally Lipschitzian functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of semismooth Newton-type methods for nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonmonotone Line Search Technique for Newton’s Method / rank
 
Normal rank

Revision as of 18:19, 2 July 2024

scientific article
Language Label Description Also known as
English
Numerical comparisons of two effective methods for mixed complementarity problems
scientific article

    Statements

    Numerical comparisons of two effective methods for mixed complementarity problems (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2010
    0 references
    MCP
    0 references
    the generalized FB function
    0 references
    semismooth
    0 references
    convergence rate
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers