A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI

DOI10.1007/s10479-022-04796-zzbMath1512.90232OpenAlexW4282916810MaRDI QIDQ6099416

Jingyong Tang, Jin Chuan Zhou, Zhongfeng Sun

Publication date: 20 June 2023

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-022-04796-z

zbMATH Keywords

nonlinear equationsuperlinear convergenceBroyden-like methodderivative-free line search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• Unnamed Item
• A smoothing Broyden-like method for polyhedral cone constrained eigenvalue problem
• A smoothing Broyden-like method with a nonmonotone derivative-free line search for nonlinear complementarity problems
• Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem
• A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function
• The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra
• Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones
• The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
• A derivative-free nonmonotone line-search technique for unconstrained optimization
• A new smoothing Broyden-like method for solving the mixed complementarity problem with a \(P_{0}\)-function
• A family of NCP functions and a descent method for the nonlinear complementarity problem
• Smoothing Newton and quasi-Newton methods for mixed complementarity problems
• Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
• A smoothing quasi-Newton method for solving general second-order cone complementarity problems
• A nonmonotone smoothing Newton algorithm for weighted complementarity problem
• A full-Newton step interior-point method for monotone weighted linear complementarity problems
• Solving system of inequalities via a smoothing homotopy method
• A modified Broyden-like quasi-Newton method for nonlinear equations
• Weighted LCPs and interior point systems for copositive linear transformations on Euclidean Jordan algebras
• A globally and superlinearly convergent smoothing Broyden-like method for solving nonlinear complementarity problem
• A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
• On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
• The “global” convergence of Broyden-like methods with suitable line search
• Quasi-Newton Methods, Motivation and Theory
• A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence
• Engineering and Economic Applications of Complementarity Problems
• A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
• A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Weighted Complementarity Problems---A New Paradigm for Computing Equilibria
• A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems
• A derivative-free nonmonotone line search and its application to the spectral residual method
• A Class of Methods for Solving Nonlinear Simultaneous Equations
• Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
• A modified BFGS method and its global convergence in nonconvex minimization
• Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming
• Globally convergent Broyden-like methods for semismooth equations and applications to VIP, NCP and MCP