Non-interior continuation method for solving the monotone semidefinite complementarity problem
From MaRDI portal
The authors propose a non-interior continuation method for solving the monotone semidefinite complementarity problems (SDCP), based on the smoothed Fischer-Burmeister function, which is shown to be globally linearly and locally quadratically convergent under suitable assumptions. In the analysis on the global linear convergence of the algorithm the assumption that the Fréchet derivative of the function involved in the SDCP is Lipschitz, is not used.
Recommendations
- A global linear and local quadratic single-step noninterior continuation method for monotone semidefinite complementarity problems
- Inexact non-interior continuation method for monotone semidefinite complementarity problems
- Non-interior continuation methods for solving semidefinite complementarity problems
- Inexact non-interior continuation method for solving large-scale monotone SDCP
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
Cited in
(24)- The convergence of a smoothing damped Gauss-Newton method for nonlinear complementarity problem
- Inexact non-interior continuation method for solving large-scale monotone SDCP
- Non-interior continuation methods for solving semidefinite complementarity problems
- A continuous trust-region-type method for solving nonlinear semidefinite complementarity problem
- Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
- A globally convergent Levenberg-Marquardt method for the least \(l_2\)-norm solution of nonlinear inequalities
- A global linear and local quadratic single-step noninterior continuation method for monotone semidefinite complementarity problems
- The quadratic convergence of a smoothing Levenberg-Marquardt method for nonlinear complementarity problem
- A new smooth NCP function for solving semidefinite nonlinear complementarity problems
- Complementarity problems over symmetric cones: A survey of recent developments in several aspects
- An inexact smoothing method for the monotone complementarity problem over symmetric cones
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
- The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities
- Noninterior continuation method for solving semidefinite programming
- scientific article; zbMATH DE number 1306987 (Why is no real title available?)
- A non-monotone inexact non-interior continuation method based on a parametric smoothing function for LWCP
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
- Convergence of a non-interior continuation algorithm for the monotone SCCP
- Inexact non-interior continuation method for monotone semidefinite complementarity problems
- A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
- On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
- A globally convergent Levenberg-Marquardt method for solving nonlinear complementarity problem
This page was built for publication: Non-interior continuation method for solving the monotone semidefinite complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401571)