On generalized convexity of nonlinear complementarity functions
From MaRDI portal
Publication:2260699
Recommendations
- Differentiability v.s. convexity for complementarity functions
- A class of nonlinear complementarity problems for multifunctions
- Some properties of nondifferentiable pseudoconvex functions
- Properties and construction of NCP functions
- On generalized pseudo- and quasiconvexities for nonsmooth functions
Cites work
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- A New Unconstrained Differentiable Merit Function for Box Constrained Variational Inequality Problems and a Damped Gauss--Newton Method
- A special newton-type optimization method
- Encyclopedia of Optimization
- Engineering and Economic Applications of Complementarity Problems
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- New NCP-functions and their properties
- Nonlinear complementarity as unconstrained and constrained minimization
- Nonlinear complementarity as unconstrained optimization
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Note on the equivalence of Kuhn-Tucker complementarity conditions to an equation
- On NCP-functions
- Properties and construction of NCP functions
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
- Properties of restricted NCP functions for nonlinear complementarity problems
Cited in
(4)
This page was built for publication: On generalized convexity of nonlinear complementarity functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2260699)