Nonlinear complementarity as unconstrained optimization
From MaRDI portal
Recommendations
- Nonlinear complementarity as unconstrained and constrained minimization
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- On the resolution of monotone complementarity problems
- scientific article; zbMATH DE number 779149
- Unconstrained minimization approaches to nonlinear complementarity problems
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- A special newton-type optimization method
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Gauss-Newton methods for the complementarity problem
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- Nonlinear complementarity as unconstrained and constrained minimization
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- Test examples for nonlinear programming codes
Cited in
(54)- Symmetrization of generalized natural residual function for NCP
- An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method
- Stationary points of bound constrained minimization reformulations of complementarity problems
- Unconstrained optimization reformulation of the generalized nonlinear complementarity problem and related method
- On generalized convexity of nonlinear complementarity functions
- Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
- Inverse problems and solution methods for a class of nonlinear complementarity problems
- Geometric views of the generalized fischer-burmeister function and its induced merit function
- A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics
- ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
- A descent method for a reformulation of the second-order cone complementarity problem
- Solution of linear complementarity problems using minimization with simple bounds
- A new class of penalized NCP-functions and its properties
- New constrained optimization reformulation of complementarity problems
- Derivative-free methods for monotone variational inequality and complementarity problems
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
- Convexity of the implicit Lagrangian
- Global method for monotone variational inequality problems with inequality constraints
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- On minimizing the implicit Lagrangian for nonlinear complementarity problems under \(H\)-differentiability
- New NCP-functions and their properties
- scientific article; zbMATH DE number 779149 (Why is no real title available?)
- On minimizing some merit functions for nonlinear complementarity problems under \(H\) -differentiability
- Neural network approaches based on new NCP-functions for solving tensor complementarity problem
- On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems
- Newton hard-thresholding pursuit for sparse linear complementarity problem via a new merit function
- On the resolution of monotone complementarity problems
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
- A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- scientific article; zbMATH DE number 1421093 (Why is no real title available?)
- Merit functions for nonsmooth complementarity problems and related descent algorithms
- A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems
- Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
- An application of \(H\)-differentiability to nonnegative and unrestricted generalized complementarity problems
- Properties of restricted NCP functions for nonlinear complementarity problems
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- Unconstrained minimization approaches to nonlinear complementarity problems
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- An unconstrained differentiable penalty method for implicit complementarity problems
- New merit functions for multiobjective optimization and their properties
- A filled function method for solving nonlinear complementarity problem
- General six-step discrete-time Zhang neural network for time-varying tensor absolute value equations
- On unconstrained and constrained stationary points of the implicit Lagrangian
- A new class of neural networks for NCPs using smooth perturbations of the natural residual function
- Nonlinear boundary equation approach for inequality 2-D elastodynamics
- Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities
- Integral global optimization method for solution of nonlinear complementarity problems
- A novel recurrent neural network for solving MLCPs and its application to linear and quadratic programming problems
- Discovery of new complementarity functions for NCP and SOCCP
This page was built for publication: Nonlinear complementarity as unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908649)