A new smoothing method for solving nonlinear complementarity problems (Q2329997): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 09:58, 12 August 2024

scientific article

Language	Label	Description	Also known as
English	A new smoothing method for solving nonlinear complementarity problems	scientific article

Statements

scholarly article

0 references

A new smoothing method for solving nonlinear complementarity problems (English)

0 references

0 references

0 references

Open Mathematics

0 references

publication date

18 October 2019

0 references

zbMATH Keywords

nonlinear complementarity problems

0 references

smoothing function

0 references

smoothing method

0 references

global convergence

0 references

quadratic convergence

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1515/math-2019-0011

0 references

Engineering and Economic Applications of Complementarity Problems

0 references

A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties

0 references

An accelerated Jacobi-gradient based iterative algorithm for solving sylvester matrix equations

0 references

A new noninterior continuation method for solving a system of equalities and inequalities

0 references

A semismooth equation approach to the solution of nonlinear complementarity problems

0 references

Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities

0 references

Jacobian Smoothing Methods for Nonlinear Complementarity Problems

0 references

A smoothing Newton method for general nonlinear complementarity problems

0 references

A special newton-type optimization method

0 references

Some Noninterior Continuation Methods for Linear Complementarity Problems

0 references

Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions

0 references

A smoothing Levenberg-Marquardt method for the extended linear complementarity problem

0 references

A smoothing Levenberg-Marquardt method for NCP

0 references

A partially smoothing Jacobian method for nonlinear complementarity problems with \(P_0\) function

0 references

Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems

0 references

Image restoration by a mixed high-order total variation and \(l_1\) regularization model

0 references

An accurate active set Newton algorithm for large scale bound constrained optimization.

0 references

An active set quasi-Newton method with projected search for bound constrained minimization

0 references

Generalized nonlinear complementarity problems with order \(P_0\) and \(R_0\) properties

0 references

A new class of smoothing functions and a smoothing Newton method for complementarity problems

0 references

A smoothing Newton method for the second-order cone complementarity problem.

0 references

A decomposition method for large-scale box constrained optimization

0 references

Relaxed inertial accelerated algorithms for solving split equality feasibility problem

0 references

Parallel algorithms for large-scale linearly constrained minimization problem

0 references

An active set strategy based on the multiplier function or the gradient.

0 references

A log-exponential smoothing method for mathematical programs with complementarity constraints

0 references

A new one-step smoothing newton method for the second-order cone complementarity problem

0 references

A smoothing Newton method for second-order cone optimization based on a new smoothing function

0 references

An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming

0 references

A new one-step smoothing Newton method for second-order cone programming.

0 references

A new infeasible-interior-point algorithm for linear programming over symmetric cones

0 references

Parallel SSLE algorithm for large scale constrained optimization

0 references

Some modifications of Newton's method with higher-order convergence for solving nonlinear equations

0 references

Stability and bifurcation of a delayed generalized fractional-order prey-predator model with interspecific competition

0 references

Hybrid variational model based on alternating direction method for image restoration

0 references

A new non-interior continuation method for second-order cone programming

0 references

Semismooth and Semiconvex Functions in Constrained Optimization

0 references

A nonsmooth version of Newton's method

0 references

Optimization and nonsmooth analysis

0 references

Homotopy Continuation Methods for Nonlinear Complementarity Problems

0 references

Matrix Analysis

0 references

Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations

0 references

A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems

0 references

NE/SQP: A robust algorithm for the nonlinear complementarity problem

0 references

Nonlinear complementarity as unconstrained and constrained minimization

0 references

Test examples for nonlinear programming codes

0 references

On the resolution of monotone complementarity problems

0 references

Iterative methods for linear complementarity problems with upperbounds on primary variables

0 references

Identifiers

zbMATH Open document ID

0 references

10.1515/math-2019-0011

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2329997

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2329997&oldid=37582579"