A new class of penalized NCP-functions and its properties
From MaRDI portal
Publication:645547
DOI10.1007/s10589-009-9315-9zbMath1254.90253OpenAlexW2161608164MaRDI QIDQ645547
C.-Y. She, Zheng-Hai Huang, Jein-Shan Chen
Publication date: 8 November 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9315-9
Related Items
Geometric views of the generalized fischer-burmeister function and its induced merit function ⋮ The linear convergence of a derivative-free descent method for nonlinear complementarity problems ⋮ A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions ⋮ Penalized NCP-functions for nonlinear complementarity problems and a scaling algorithm ⋮ A new class of smoothing functions and a smoothing Newton method for complementarity problems ⋮ A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems ⋮ Discovery of new complementarity functions for NCP and SOCCP ⋮ Nonsmooth Levenberg-Marquardt type method for solving a class of stochastic linear complementarity problems with finitely many elements ⋮ A new semismooth Newton method for NCPs based on the penalized KK function ⋮ A smoothing Newton method for absolute value equation associated with second-order cone ⋮ Symmetrization of generalized natural residual function for NCP
Cites Work
- Unnamed Item
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- 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
- 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
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- On NCP-functions
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- A comparison of large scale mixed complementarity problem solvers
- New NCP-functions and their properties
- A penalized Fischer-Burmeister NCP-function
- On the resolution of monotone complementarity problems
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- Nonlinear complementarity as unconstrained optimization
- A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties
- Unconstrained minimization approaches to nonlinear complementarity problems
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- Newton's Method for B-Differentiable Equations
- Iterative methods for variational and complementarity problems
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- A special newton-type optimization method
- A Trust Region Method for Solving Generalized Complementarity Problems
- A Nonmonotone Line Search Technique for Newton’s Method
- An iterative scheme for variational inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP
- Benchmarking optimization software with performance profiles.
