An interior-point derivative-free algorithm for nonlinear complementarity problems

DOI10.1007/S11075-024-01966-XMaRDI QIDQ6936563zbMATH OpenFDO

Authors Jueyu Wang, Chao Gu, Detong Zhu

Publication date 29 August 2025

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11075-024-01966-X

zbMATH Keywords

convergencederivative-freeinterior-pointNCP-functionnonlinear complementarity problemstationary point

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Cites work

• A derivative-free filter algorithm for nonlinear complementarity problem
• A dwindling filter line search method for unconstrained optimization
• A family of NCP functions and a descent method for the nonlinear complementarity problem
• A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem
• A Filter-Trust-Region Method for Unconstrained Optimization
• A Finsler geometrical programming approach to the nonlinear complementarity problem of traffic equilibrium
• A globally and superlinearly convergent modified SQP-filter method
• A modified SQP-filter method for nonlinear complementarity problem
• A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
• A new class of penalized NCP-functions and its properties
• A new filter algorithm for a system of nonlinear equations
• A new inexact SQP algorithm for nonlinear systems of mixed equalities and inequalities
• A new nonmonotone line search technique for unconstrained optimization
• A new smoothing-type algorithm for nonlinear weighted complementarity problem
• A nonmonotone derivative-free algorithm for nonlinear complementarity problems based on the new generalized penalized Fischer-Burmeister merit function
• A nonmonotone smoothing Newton method for circular cone programming
• A penalty method for a mixed nonlinear complementarity problem
• A power penalty approach to a nonlinear complementarity problem
• A power penalty method for a bounded nonlinear complementarity problem
• A power penalty method for linear complementarity problems
• A power penalty method for second-order cone nonlinear complementarity problems
• A power penalty method for solving a nonlinear parabolic complementarity problem
• A smooth Newton method with 3-1 piecewise NCP function for generalized nonlinear complementarity problem
• An R-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
• An interior penalty method for a finite-dimensional linear complementarity problem in financial engineering
• Benchmarking optimization software with performance profiles.
• Convergence of a three-dimensional dwindling filter algorithm without feasibility restoration phase
• Convergence property of an interior penalty approach to pricing American option
• Derivative-free methods for monotone variational inequality and complementarity problems
• Engineering and Economic Applications of Complementarity Problems
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• Global convergence of a robust filter SQP algorithm
• scientific article; zbMATH DE number 1569004 (Why is no real title available?)
• scientific article; zbMATH DE number 757678 (Why is no real title available?)
• Inexact spectral projected gradient methods on convex sets
• Jacobian consistency of a one-parametric class of smoothing Fischer-Burmeister functions for SOCCP
• New modulus-based matrix splitting method for the vertical nonlinear complementarity problem
• Nonlinear programming without a penalty function.
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• On the Goldstein-Levitin-Polyak gradient projection method
• On the resolution of monotone complementarity problems
• Power penalty method for a linear complementarity problem arising from American option valuation
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
• The linear convergence of a derivative-free descent method for nonlinear complementarity problems
• The nonsmooth Newton's method for the horizontal nonlinear complementarity problem
• The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra

This page was built for publication: An interior-point derivative-free algorithm for nonlinear complementarity problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6936563)