A non-interior continuation algorithm for the CP based on a generalized smoothing function
From MaRDI portal
Publication:629488
DOI10.1016/j.cam.2010.10.027zbMath1211.65073OpenAlexW1968386939MaRDI QIDQ629488
Publication date: 9 March 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.10.027
algorithmnumerical resultslocal quadratic convergencecomplementarity problemglobal linear convergencenon-interior continuation algorithm
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A fixed-point method for a class of super-large scale nonlinear complementarity problems, A full-Newton step non-interior continuation algorithm for a class of complementarity problems, A non-monotone inexact non-interior continuation method based on a parametric smoothing function for LWCP
Cites Work
- Unnamed Item
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
- A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities
- A regularized smoothing-type algorithm for solving a system of inequalities with a \(P_{0}\)-function
- A smoothing-type algorithm for solving system of inequalities
- A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
- A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- Improved smoothing-type methods for the solution of linear programs
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A comparison of large scale mixed complementarity problem solvers
- On unconstrained and constrained stationary points of the implicit Lagrangian
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- A regularization Newton method for solving nonlinear complementarity problems
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
- A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties
- The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems
- Engineering and Economic Applications of Complementarity Problems
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- A Global and Local Superlinear Continuation-Smoothing Method forP0andR0NCP or Monotone NCP
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP
