Unconstrained minimization approaches to nonlinear complementarity problems (Q2564612): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On unconstrained and constrained stationary points of the implicit Lagrangian / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special newton-type optimization method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the resolution of monotone complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear complementarity as unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear complementarity as unconstrained and constrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stationary points of the implicit Lagrangian for nonlinear complementarity problems / rank
 
Normal rank

Revision as of 09:20, 27 May 2024

scientific article
Language Label Description Also known as
English
Unconstrained minimization approaches to nonlinear complementarity problems
scientific article

    Statements

    Unconstrained minimization approaches to nonlinear complementarity problems (English)
    0 references
    0 references
    15 January 1997
    0 references
    uniform \(P\)-function
    0 references
    nonlinear complementarity
    0 references
    unconstrained minimization problems
    0 references
    merit functions
    0 references
    descent algorithm
    0 references

    Identifiers