Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
From MaRDI portal
(Redirected from Publication:1026431)
Recommendations
- scientific article; zbMATH DE number 1569004
- Properties of a family of merit functions and a merit function method for the NCP
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- An R-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
- A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer-Burmeister merit function
Cites work
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- A Nonmonotone Line Search Technique for Newton’s Method
- A nonsmooth version of Newton's method
- A penalized Fischer-Burmeister NCP-function
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
- A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties
- A Trust Region Method for Solving Generalized Complementarity Problems
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Engineering and Economic Applications of Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- scientific article; zbMATH DE number 50640 (Why is no real title available?)
- scientific article; zbMATH DE number 757678 (Why is no real title available?)
- Iterative Solution of Nonlinear Equations in Several Variables
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- New NCP-functions and their properties
- On NCP-functions
- ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- Semismooth and Semiconvex Functions in Constrained Optimization
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Sub-quadratic convergence of a smoothing Newton algorithm for the P₀- and monotone LCP
- The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
Cited in
(28)- A family of NCP functions and a descent method for the nonlinear complementarity problem
- A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions
- Discovery of new complementarity functions for NCP and SOCCP
- Symmetrization of generalized natural residual function for NCP
- A new class of smoothing functions and a smoothing Newton method for complementarity problems
- A smoothing Newton method for absolute value equation associated with second-order cone
- Some results on the filter method for nonlinear complementary problems
- Penalized NCP-functions for nonlinear complementarity problems and a scaling algorithm
- On generalized convexity of nonlinear complementarity functions
- Tensor complementarity problems. II: Solution methods
- A new smoothing method for solving nonlinear complementarity problems
- The linear convergence of a derivative-free descent method for nonlinear complementarity problems
- Variationally consistent discretization schemes and numerical algorithms for contact problems
- Modified Newton-type methods for the NCP by using a class of one-parametric NCP-functions
- A full-Newton step non-interior continuation algorithm for a class of complementarity problems
- scientific article; zbMATH DE number 7416500 (Why is no real title available?)
- A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems
- A non-interior continuation algorithm for the CP based on a generalized smoothing function
- A new class of penalized NCP-functions and its properties
- A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer-Burmeister merit function
- A non-monotone smoothing Newton algorithm for absolute value equations associated with second-order cone
- Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem
- An interior-point derivative-free algorithm for nonlinear complementarity problems
- Properties and construction of NCP functions
- A non-monotone smoothing Newton algorithm for solving the system of generalized absolute value equations
- Properties of a family of merit functions and a merit function method for the NCP
- An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function
- A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
This page was built for publication: Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026431)
