111 research outputs found
A Semismooth Newton Method for Tensor Eigenvalue Complementarity Problem
In this paper, we consider the tensor eigenvalue complementarity problem
which is closely related to the optimality conditions for polynomial
optimization, as well as a class of differential inclusions with nonconvex
processes. By introducing an NCP-function, we reformulate the tensor eigenvalue
complementarity problem as a system of nonlinear equations. We show that this
function is strongly semismooth but not differentiable, in which case the
classical smoothing methods cannot apply. Furthermore, we propose a damped
semismooth Newton method for tensor eigenvalue complementarity problem. A new
procedure to evaluate an element of the generalized Jocobian is given, which
turns out to be an element of the B-subdifferential under mild assumptions. As
a result, the convergence of the damped semismooth Newton method is guaranteed
by existing results. The numerical experiments also show that our method is
efficient and promising
Further Application of H
We study nonsmooth generalized complementarity problems based on the generalized Fisher-Burmeister function and its generalizations, denoted by GCP(f,g) where f and g are H-differentiable. We describe H-differentials of some GCP functions based on the generalized Fisher-Burmeister function and its generalizations, and their merit functions. Under appropriate conditions on the H-differentials of f and g, we show that a local/global minimum of a merit function (or a “stationary point” of a merit function) is coincident with the solution of the given generalized complementarity problem. When specializing GCP(f,g) to the nonlinear complementarity problems, our results not only give new results but also extend/unify various similar results proved for C1, semismooth, and locally Lipschitzian
Hybrid Newton-type method for a class of semismooth equations
In this paper, we present a hybrid method for the solution of a class of composite semismooth equations encountered frequently in applications. The method is obtained by combining a generalized finite-difference Newton method to an inexpensive direct search method. We prove that, under standard assumptions, the method is globally convergent with a local rate of convergence which is superlinear or quadratic. We report also several numerical results obtained applying the method to suitable reformulations of well-known nonlinear complementarity problem
A Probability-one Homotopy Algoithm for Non-Smooth Equations and Mixed Complementarity Problems
A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations,where the norm of the residual has non-global local minima.The algorithm is based on constructing homotopy mappings that are smooth in the interior of their domains.The algorithm is specialized to solve mixed complementarity problems through the use of MCP functions and associated smoothers.This specialized algorithm includes an option to ensure that all iterates remain feasible.Easily satisfiable sufficient conditions are given to ensure that the homotopy zero curve remains feasible,and global convergence properties for the MCP algorithm are developed.Computational results on the MCPLIB test library demonstrate the effectiveness of the algorithm
A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs
[[abstract]]We present a smooth approximation for the generalized Fischer-Burmeister function where the 2-norm in the FB function is relaxed to a general p-norm (p > 1), and
establish some favorable properties for it, for example, the Jacobian consistency. With the smoothing function, we transform the mixed complementarity problem (MCP) into
solving a sequence of smooth system of equations.
- …