A new smoothing method for solving nonlinear complementarity problems
From MaRDI portal
Publication:2329997
DOI10.1515/math-2019-0011zbMath1430.90533OpenAlexW2920911036WikidataQ128296893 ScholiaQ128296893MaRDI QIDQ2329997
Publication date: 18 October 2019
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2019-0011
global convergencequadratic convergencenonlinear complementarity problemssmoothing methodsmoothing function
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (8)
Un algoritmo global con jacobiano suavizado para problemas de complementariedad no lineal ⋮ A new approach for solving nonlinear algebraic systems with complementarity conditions. Application to compositional multiphase equilibrium problems ⋮ Endpoint regularity of discrete multilinear fractional nontangential maximal functions ⋮ Interior point methods for solving Pareto eigenvalue complementarity problems ⋮ Quantum voting scheme based on locally indistinguishable orthogonal product states ⋮ Image restoration by second-order total generalized variation and wavelet frame regularization ⋮ Convergence analysis of a trust-region multidimensional filter method for nonlinear complementarity problems ⋮ A novel quantum multi-signature protocol based on locally indistinguishable orthogonal product states
Cites Work
- A smoothing Newton method for the second-order cone complementarity problem.
- A log-exponential smoothing method for mathematical programs with complementarity constraints
- Parallel algorithms for large-scale linearly constrained minimization problem
- An accurate active set Newton algorithm for large scale bound constrained optimization.
- An active set strategy based on the multiplier function or the gradient.
- Parallel SSLE algorithm for large scale constrained optimization
- A smoothing Newton method for second-order cone optimization based on a new smoothing function
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- A new one-step smoothing Newton method for second-order cone programming.
- Generalized nonlinear complementarity problems with order \(P_0\) and \(R_0\) properties
- A smoothing Levenberg-Marquardt method for the extended linear complementarity problem
- An active set quasi-Newton method with projected search for bound constrained minimization
- Some modifications of Newton's method with higher-order convergence for solving nonlinear equations
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
- Test examples for nonlinear programming codes
- Nonlinear complementarity as unconstrained and constrained minimization
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A decomposition method for large-scale box constrained optimization
- Hybrid variational model based on alternating direction method for image restoration
- Image restoration by a mixed high-order total variation and \(l_1\) regularization model
- Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions
- On the resolution of monotone complementarity problems
- A smoothing Newton method for general nonlinear complementarity problems
- A new class of smoothing functions and a smoothing Newton method for complementarity problems
- Stability and bifurcation of a delayed generalized fractional-order prey-predator model with interspecific competition
- A new noninterior continuation method for solving a system of equalities and inequalities
- A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function
- A nonsmooth version of Newton's method
- A new infeasible-interior-point algorithm for linear programming over symmetric cones
- A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties
- A smoothing Levenberg-Marquardt method for NCP
- A new one-step smoothing newton method for the second-order cone complementarity problem
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- Matrix Analysis
- Optimization and nonsmooth analysis
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- Semismooth and Semiconvex Functions in Constrained Optimization
- A special newton-type optimization method
- Engineering and Economic Applications of Complementarity Problems
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Relaxed inertial accelerated algorithms for solving split equality feasibility problem
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Jacobian Smoothing Methods for Nonlinear Complementarity Problems
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Iterative methods for linear complementarity problems with upperbounds on primary variables
- An accelerated Jacobi-gradient based iterative algorithm for solving sylvester matrix equations
- An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming
- A new non-interior continuation method for second-order cone programming
This page was built for publication: A new smoothing method for solving nonlinear complementarity problems
