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

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

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

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

90C25: Convex programming

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

Related Items

A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, A predictor-corrector smoothing Newton method for symmetric cone complementarity problems, Polynomial time solvability of non-symmetric semidefinite programming, 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

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