Pages that link to "Item:Q2565032"
From MaRDI portal
The following pages link to Equivalence of the generalized complementarity problem to differentiable unconstrained minimization (Q2565032):
Displaying 32 items.
- The Levenberg-Marquardt-type methods for a kind of vertical complementarity problem (Q410763) (← links)
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem (Q415364) (← links)
- Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem (Q619752) (← links)
- Risk-averse traffic assignment with elastic demands: NCP formulation and solution method for assessing performance reliability (Q862489) (← links)
- Growth behavior of two classes of merit functions for symmetric cone complementarity problems (Q1029282) (← links)
- Global error bound for the generalized linear complementarity problem over a polyhedral cone (Q1035916) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- New NCP-functions and their properties (Q1367789) (← links)
- A cell-based dynamic traffic assignment model: Formulation and properties (Q1609417) (← links)
- Nonmonotone smoothing Broyden-like method for generalized nonlinear complementarity problems (Q1676990) (← links)
- Further application of \(H\)-differentiability to generalized complementarity problems based on generalized Fisher-Burmeister functions (Q1724181) (← links)
- Generalized Newton method for a kind of complementarity problem (Q1724879) (← links)
- Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs (Q1765864) (← links)
- On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems (Q1807824) (← links)
- A smoothing inexact Newton method for generalized nonlinear complementarity problem (Q1954743) (← links)
- Nonemptiness and compactness of solution sets to generalized polynomial complementarity problems (Q1985273) (← links)
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem (Q2044578) (← links)
- Unique solvability of weakly homogeneous generalized variational inequalities (Q2046317) (← links)
- A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems (Q2269819) (← links)
- A smoothing Newton-type method for generalized nonlinear complementarity problem (Q2475399) (← links)
- An application of \(H\)-differentiability to nonnegative and unrestricted generalized complementarity problems (Q2479827) (← links)
- Growth behavior of a class of merit functions for the nonlinear complementarity problem (Q2564173) (← links)
- A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone (Q2572346) (← links)
- A Finsler geometrical programming approach to the nonlinear complementarity problem of traffic equilibrium (Q2696966) (← links)
- An unconstrained differentiable penalty method for implicit complementarity problems (Q2829561) (← links)
- Modulus-based matrix splitting iteration methods for a class of implicit complementarity problems (Q2955973) (← links)
- Unconstrained optimization reformulation of the generalized nonlinear complementarity problem and related method (Q3534644) (← links)
- On error bounds of polynomial complementarity problems with structured tensors (Q4639133) (← links)
- Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach (Q4884045) (← links)
- Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems. (Q5929416) (← links)
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming (Q5942348) (← links)
- New modulus-based matrix splitting method for the vertical nonlinear complementarity problem (Q6653496) (← links)
