A one-parametric class of merit functions for the symmetric cone complementarity problem

DOI10.1016/j.jmaa.2009.01.064zbMath1180.90341OpenAlexW2017356678MaRDI QIDQ1018348

Shaohua Pan, Jein-Shan Chen

Publication date: 19 May 2009

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2009.01.064

zbMATH Keywords

smoothnessmerit functionJordan algebrasymmetric cone complementarity problemsCartesian \(P\)-propertiesLipschtiz continuity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) 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, Differentiability v.s. convexity for complementarity functions, An inexact smoothing method for the monotone complementarity problem over symmetric cones, A new model for solving stochastic second-order cone complementarity problem and its convergence analysis, 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 two-parametric class of merit functions for the second-order cone complementarity problem, Convergence of a non-interior continuation algorithm for the monotone SCCP, Stationary point conditions for the FB merit function associated with symmetric cones, 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, On the Lorentz Cone Complementarity Problems in Infinite-Dimensional Real Hilbert Space, A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems, Improved smoothing Newton methods for symmetric cone complementarity problems, The same growth of FB and NR symmetric cone complementarity functions, A new class of complementarity functions for symmetric cone complementarity problems, On merit functions for \(p\)-order cone complementarity problem, An inexact modified Newton method for VISCC and application in grasping force, A new class of smoothing complementarity functions over symmetric cones, Constructions of complementarity functions and merit functions for circular cone complementarity problem, A one-parametric class of smoothing functions for second-order cone programming, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, A nonmonotone smoothing Newton algorithm for weighted complementarity problem, A projection and contraction method for symmetric cone complementarity problem, Three classes of merit functions for the complementarity problem over a closed convex cone, Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search

Uses Software

• SCCP

Cites Work

• Unnamed Item
• Some P-properties for linear transformations on Euclidean Jordan algebras
• Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
• The \(SC^1\) property of the squared norm of the SOC Fischer-Burmeister function
• A one-parametric class of merit functions for the second-order cone complementarity problem
• Applications of second-order cone programming
• A new class of semismooth Newton-type methods for nonlinear complementarity problems
• Merit functions for semi-definite complementarity problems
• The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
• Nonlinear complementarity as unconstrained and constrained minimization
• New NCP-functions and their properties
• 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
• Second-order cone programming
• A primal-dual potential reduction method for problems involving matrix inequalities
• Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
• A note on the Lipschitz continuity of the gradient of the squared norm of the matrix-valued Fischer-Burmeister function
• An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
• Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
• Smoothing Functions for Second-Order-Cone Complementarity Problems
• 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
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Some P-Properties for Nonlinear Transformations on Euclidean Jordan Algebras
• Applications of geometric means on symmetric cones