Nonlinear complementarity as unconstrained optimization
From MaRDI portal
Publication:1908649
DOI10.1007/BF02192026zbMATH Open0845.90120MaRDI QIDQ1908649FDOQ1908649
Publication date: 4 March 1996
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Test examples for nonlinear programming codes
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- A special newton-type optimization method
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- Gauss-Newton methods for the complementarity problem
- Nonlinear complementarity as unconstrained and constrained minimization
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
Cited In (51)
- New merit functions for multiobjective optimization and their properties
- 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
- Geometric views of the generalized fischer-burmeister function and its induced merit function
- ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
- A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics
- Newton Hard-Thresholding Pursuit for Sparse Linear Complementarity Problem via A New Merit Function
- A descent method for a reformulation of the second-order cone complementarity problem
- Solution of linear complementarity problems using minimization with simple bounds
- New constrained optimization reformulation of complementarity problems
- A new class of penalized NCP-functions and its properties
- Derivative-free methods for monotone variational inequality and complementarity problems
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
- 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
- A NOVEL RECURRENT NEURAL NETWORK FOR SOLVING MLCPs AND ITS APPLICATION TO LINEAR AND QUADRATIC PROGRAMMING PROBLEMS
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- Convergence analysis of nonmonotone Levenberg-Marquardt algorithms for complementarity problem
- Title not available (Why is that?)
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- New NCP-functions and their properties
- On minimizing the implicit Lagrangian for nonlinear complementarity problems under \(H\)-differentiability
- Neural network approaches based on new NCP-functions for solving tensor complementarity problem
- On minimizing some merit functions for nonlinear complementarity problems under \(H\) -differentiability
- On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems
- On the resolution of monotone complementarity problems
- A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- Title not available (Why is that?)
- 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
- 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
- Properties of restricted NCP functions for nonlinear complementarity problems
- 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
- 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)