ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
From MaRDI portal
Publication:5295441
DOI10.1142/S0217595907001292zbMath1141.90557OpenAlexW2149255010MaRDI QIDQ5295441
Publication date: 30 July 2007
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595907001292
Related Items
Geometric views of the generalized fischer-burmeister function and its induced merit function, An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function, An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method, Neural network approaches based on new NCP-functions for solving tensor complementarity problem, A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions, A modulus-based nonmonotone line search method for nonlinear complementarity problems, Modified Newton-type methods for the NCP by using a class of one-parametric NCP-functions, The descent algorithms for solving symmetric Pareto eigenvalue complementarity problem., A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints, Discovery of new complementarity functions for NCP and SOCCP, A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer-Burmeister merit function, Further application of \(H\)-differentiability to generalized complementarity problems based on generalized Fisher-Burmeister functions, Nonsmooth Levenberg-Marquardt type method for solving a class of stochastic linear complementarity problems with finitely many elements, On construction of new NCP functions, A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs, Properties and construction of NCP functions, Numerical comparisons of two effective methods for mixed complementarity problems, A smoothing Newton method for absolute value equation associated with second-order cone, Properties of a family of merit functions and a merit function method for the NCP, Symmetrization of generalized natural residual function for NCP, A family of NCP functions and a descent method for the nonlinear complementarity problem, Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems, Variationally consistent discretization schemes and numerical algorithms for contact problems, An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function
Cites Work
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- On NCP-functions
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- New NCP-functions and their properties
- On the resolution of monotone complementarity problems
- Nonlinear complementarity as unconstrained optimization
- A nonsmooth version of Newton's method
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- Optimization and nonsmooth analysis
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Semismooth and Semiconvex Functions in Constrained Optimization
- A special newton-type optimization method
- Variational Analysis
- Engineering and Economic Applications of Complementarity Problems
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
