The linear convergence of a derivative-free descent method for nonlinear complementarity problems
From MaRDI portal
Publication:2628209
Recommendations
- scientific article; zbMATH DE number 1569004
- Solving non-linear complementarity problem by a derivative-free descent method
- A linearly convergent derivative-free descent method for strongly monotone complementarity problems
- scientific article; zbMATH DE number 1507133
- scientific article; zbMATH DE number 5926397
- A linearly convergent derivative-free descent method for the second-order cone complementarity problem
- Some research o derivative-free descent method for nonlinear complementarity problem
- A method for solving nonlinear complementarity problems and its convergence properties
- A derivative-free method for linearly constrained nonsmooth optimization
- A descent algorithm for the nonlinear complementarity problems
Cites work
- A comparison of large scale mixed complementarity problem solvers
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- A linearly convergent derivative-free descent method for strongly monotone complementarity problems
- A new class of penalized NCP-functions and its properties
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
- A Trust Region Method for Solving Generalized Complementarity Problems
- An R-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
- 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
- scientific article; zbMATH DE number 5800589 (Why is no real title available?)
- scientific article; zbMATH DE number 1059228 (Why is no real title available?)
- scientific article; zbMATH DE number 1569004 (Why is no real title available?)
- Iterative Solution of Nonlinear Equations in Several Variables
- On the resolution of monotone complementarity problems
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
- Properties of a family of merit functions and a merit function method for the NCP
- 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
(8)- A linearly convergent derivative-free descent method for strongly monotone complementarity problems
- Some results on the filter method for nonlinear complementary problems
- Penalized NCP-functions for nonlinear complementarity problems and a scaling algorithm
- Some research o derivative-free descent method for nonlinear complementarity problem
- scientific article; zbMATH DE number 1300180 (Why is no real title available?)
- scientific article; zbMATH DE number 1507133 (Why is no real title available?)
- An interior-point derivative-free algorithm for nonlinear complementarity problems
- An R-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
This page was built for publication: The linear convergence of a derivative-free descent method for nonlinear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2628209)
