Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search

DOI10.1007/s11425-008-0170-4zbMath1203.90123OpenAlexW2050967416MaRDI QIDQ1041534

Sheng-Long Hu, Zheng-Hai Huang, Ji-ye Han

Publication date: 2 December 2009

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-008-0170-4

Mathematics Subject Classification ID

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

Related Items

Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP, Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones, A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities, A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS, Properties of a Class of Nonlinear Transformations Over Euclidean Jordan Algebras with Applications to Complementarity Problems, A generalized smoothing Newton method for the symmetric cone complementarity problem, A new smoothing and regularization Newton method for the symmetric cone complementarity problem, A predictor-corrector smoothing Newton method for symmetric cone complementarity problems, Polynomial time solvability of non-symmetric semidefinite programming, Half thresholding eigenvalue algorithm for semidefinite matrix completion, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, A new nonmonotone smoothing Newton method for the symmetric cone complementarity problem with the Cartesian \(P_0\)-property, A homogeneous smoothing-type algorithm for symmetric cone linear programs, On matrix characterizations for \(P\)-property of the linear transformation in second-order cone linear complementarity problems, Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming., Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP, Numerical study of a smoothing algorithm for the complementarity system over the second-order cone, A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS, A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems, Improved convergence results for an inexact smoothing method for the second-order cone complementarity problem, An inexact modified Newton method for VISCC and application in grasping force, A one-parametric class of smoothing functions and an improved regularization Newton method for the NCP, A nonmonotone smoothing Newton algorithm for weighted complementarity problem, Predictor-corrector inexact smoothing algorithm for symmetric cone complementarity problems with Cartesian \(P_0\)-property, A nonmonotone smoothing Newton method for circular cone programming, A projection and contraction method for symmetric cone complementarity problem, A smoothing Newton method with a mixed line search for monotone weighted complementarity problems, A smoothing Newton method for symmetric cone complementarity problem

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
• Smoothing algorithms for complementarity problems over symmetric cones
• A one-parametric class of merit functions for the symmetric cone complementarity problem
• Complementarity problems over cones with monotone and pseudomonotone maps
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Euclidean Jordan algebras and interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms
• Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem
• New smooth C-functions for symmetric cone complementarity problems
• Convergence properties of a non-interior-point smoothing algorithm for the \(P*\)NCP
• Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for 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
• VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
• A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P₀LCPs
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
• Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
• An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming