The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
From MaRDI portal
(Redirected from Publication:858580)
Recommendations
- Merit functions for nonsmooth complementarity problems and related descent algorithms
- Properties of a family of merit functions and a merit function method for the NCP
- scientific article; zbMATH DE number 1059228
- A descent Newton method for solving nonlinear complementarity problem with \(P_0\)-function
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
Cites work
- scientific article; zbMATH DE number 1552025 (Why is no real title available?)
- scientific article; zbMATH DE number 1569004 (Why is no real title available?)
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems
- A nonsmooth version of Newton's method
- A special newton-type optimization method
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Convex Analysis
- Convex analysis and nonlinear optimization. Theory and examples
- 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
- Iterative Solution of Nonlinear Equations in Several Variables
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- Nonlinear complementarity as unconstrained optimization
- On NCP-functions
- On stationary points of the implicit Lagrangian for nonlinear complementarity problems
- On the resolution of monotone complementarity problems
- Optimization and nonsmooth analysis
- Semismooth Matrix-Valued Functions
- Semismooth and Semiconvex Functions in Constrained Optimization
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
- Unconstrained minimization approaches to nonlinear complementarity problems
- Variational Analysis
Cited in
(35)- Compressed sensing based on trust region method
- Symmetrization of generalized natural residual function for NCP
- A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs
- An almost smooth equation reformulation to the nonlinear complementarity problem and Newton's method
- Numerical comparisons of two effective methods for mixed complementarity problems
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
- Neural network for solving SOCQP and SOCCVI based on two discrete-type classes of SOC complementarity functions
- A regularization Newton method based on the generalized Fischer-Burmeister smoothing function for the NCP
- 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 new class of penalized NCP-functions and its properties
- Inexact Newton method for solving generalized Nash equilibrium problems
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
- A novel gradient-based neural network for solving convex second-order cone constrained variational inequality problems
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- Smoothing algorithms for complementarity problems over symmetric cones
- A new class of smoothing functions and a smoothing Newton method for complementarity problems
- A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
- Perspective functions: properties, constructions, and examples
- A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions
- Levenberg-Marquardt method with a general LM parameter and a nonmonotone trust region technique
- Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem
- The H-differentiability and calmness of circular cone functions
- A neural network based on the generalized Fischer-Burmeister function for nonlinear complementarity problems
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem
- Neural networks for solving second-order cone constrained variational inequality problem
- Some results on the filter method for nonlinear complementary problems
- A continuation approach for solving binary quadratic program based on a class of NCP-functions
- A smoothing Newton method for absolute value equation associated with second-order cone
- A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI
- Nonsmooth Levenberg-Marquardt type method for solving a class of stochastic linear complementarity problems with finitely many elements
- An inexact semismooth Newton SAA-based algorithm for stochastic nonsmooth SOC complementarity problems with application to a stochastic power flow programming problem
- The linear convergence of a derivative-free descent method for nonlinear complementarity problems
- Discovery of new complementarity functions for NCP and SOCCP
This page was built for publication: The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858580)
