A new hybrid method for nonlinear complementarity problems

DOI10.1007/s10589-009-9309-7zbMath1242.90264MaRDI QIDQ548690

Mark Goh, Xiujie Zhang, Shao-Jian Qu

Publication date: 30 June 2011

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-009-9309-7

zbMATH Keywords

trust region method; line search; conic model; nonmonotone technique; NCP

Mathematics Subject Classification ID

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Related Items

A New Proof for Global Convergence of a Smoothing Homotopy Method for the Nonlinear Complementarity Problem, Nonmonotone gradient methods for vector optimization with a portfolio optimization application, A continuous trust-region-type method for solving nonlinear semidefinite complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global convergence of a two-parameter family of conjugate gradient methods without line search
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A nonmonotone trust region method for unconstrained optimization
• A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy
• A nonmonotone trust-region method of conic model for unconstrained optimization
• Interpolation by conic model for unconstrained optimization
• A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
• Solution of monotone complementarity problems with locally Lipschitzian functions
• Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions
• A nonmonotone adaptive trust region method and its convergence
• A trust-region method by active-set strategy for general nonlinear optimization
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• On the global convergence of trust region algorithms for unconstrained minimization
• A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
• Conic Approximations and Collinear Scalings for Optimizers
• The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
• Strongly Regular Generalized Equations
• 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
• A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
• A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
• Jacobian Smoothing Methods for Nonlinear Complementarity Problems
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• A Nonmonotone Line Search Technique for Newton’s Method
• Trust Region Algorithms for Solving Nonsmooth Equations
• Optimality Conditions for Trust-Region Subproblems Involving a Conic Model
• A norm descent BFGS method for solving KKT systems of symmetric variational inequality problems
• A nonmonotone trust region method for nonlinear programming with simple bound constraints
• Global convergence of conjugate gradient methods without line search