Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
From MaRDI portal
Publication:2565032
Recommendations
Cites work
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- A special newton-type optimization method
- Complementarity problems
- Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- scientific article; zbMATH DE number 955453 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 1329059 (Why is no real title available?)
- Inexact Newton methods for the nonlinear complementarity problem
- New Error Bounds for the Linear Complementarity Problem
- New improved error bounds for the linear complementarity problem
- Nonlinear complementarity as unconstrained and constrained minimization
- Nonlinear complementarity as unconstrained optimization
- On a Generalization of a Normal Map and Equation
- On a global projection-type error bound for the linear complementarity problem
- On P- and S-functions and related classes of \(n\)-dimensional nonlinear mappings
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- The quasi-complementarity problem
- Unconstrained minimization approaches to nonlinear complementarity problems
Cited in
(38)- Growth behavior of two classes of merit functions for symmetric cone complementarity problems
- Global error bound for the generalized linear complementarity problem over a polyhedral cone
- Error bounds in mathematical programming
- New NCP-functions and their properties
- A cell-based dynamic traffic assignment model: Formulation and properties
- A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions
- Nonmonotone smoothing Broyden-like method for generalized nonlinear complementarity problems
- Further application of H-differentiability to generalized complementarity problems based on generalized Fisher-Burmeister functions
- Generalized Newton method for a kind of complementarity problem
- Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
- On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems
- A smoothing inexact Newton method for generalized nonlinear complementarity problem
- Nonemptiness and compactness of solution sets to generalized polynomial complementarity problems
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- Unique solvability of weakly homogeneous generalized variational inequalities
- A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems
- A smoothing Newton-type method for generalized nonlinear complementarity problem
- An application of \(H\)-differentiability to nonnegative and unrestricted generalized complementarity problems
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone
- A Finsler geometrical programming approach to the nonlinear complementarity problem of traffic equilibrium
- An unconstrained differentiable penalty method for implicit complementarity problems
- Modulus-based matrix splitting iteration methods for a class of implicit complementarity problems.
- Unconstrained optimization reformulation of the generalized nonlinear complementarity problem and related method
- The Levenberg-Marquardt-type methods for a kind of vertical complementarity problem
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem
- Generalized complementarity problems based on generalized Fisher-Burmeister functions as unconstrained optimization
- On error bounds of polynomial complementarity problems with structured tensors
- Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
- Error bounds for R₀-type and monotone nonlinear complementarity problems.
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
- The smoothing conjugate gradient method for a kind of generalized polynomial complementarity problem
- Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem
- New modulus-based matrix splitting method for the vertical nonlinear complementarity problem
- The Levenberg-Marquardt algorithm for solving the generalized complementarity problems
- The error bounds of linear and tensor complementarity problems
- Risk-averse traffic assignment with elastic demands: NCP formulation and solution method for assessing performance reliability
- Nonsmooth generalized complementarity as unconstrained optimization
This page was built for publication: Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565032)
