A predictor-corrector smoothing Newton method for symmetric cone complementarity problems

DOI10.1016/j.amc.2010.08.032zbMath1206.65162MaRDI QIDQ613219

San-Yang Liu, Li-Xia Liu, Hong-Wei Liu

Publication date: 20 December 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.08.032

zbMATH Keywords

global and local convergence; smoothing Newton predictor-corrector method; symmetric cone complementarity problems

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

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

Related Items

A generalized smoothing Newton method for the symmetric cone complementarity problem, Some P-properties of the quadratic representations and automorphism invariance in Euclidean Jordan algebras, An inexact semismooth Newton method for variational inequality with symmetric cone constraints

Uses Software

• SCCP

Cites Work

• Unnamed Item
• Unnamed Item
• Some P-properties for linear transformations on Euclidean Jordan algebras
• Analysis of a smoothing method for symmetric conic linear programming
• Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem
• A one-step smoothing Newton method for second-order cone programming
• Smoothing algorithms for complementarity problems over symmetric cones
• Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
• Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP without strict complementarity
• Extension of primal-dual interior point algorithms to symmetric cones
• Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
• Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms
• Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A nonsmooth version of Newton's method
• Extension of smoothing functions to symmetric cone complementarity problems
• Convergence properties of a non-interior-point smoothing algorithm for the \(P*\)NCP
• On the coerciveness of some merit functions for complementarity problems over symmetric cones
• Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
• A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
• SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
• Semismooth and Semiconvex Functions in Constrained Optimization
• A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P₀LCPs
• Improving the convergence of non-interior point algorithms for nonlinear complementarity problems