Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems.

DOI10.21136/AM.2021.0129-20OpenAlexW4200485142MaRDI QIDQ2128412

Jingyong Tang, Yue-fen Chen

Publication date: 22 April 2022

Published in: Applications of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21136/am.2021.0129-20

zbMATH Keywords

smoothing algorithmcircular cone complementarity problemsmoothing functionsuperlinear/quadratical convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A smoothing Newton method for the second-order cone complementarity problem.
• A smoothing Newton-type method for second-order cone programming problems based on a new smoothing Fischer-Burmeister function
• A modified smoothing and regularized Newton method for monotone second-order cone complementarity problems
• A generalized Newton method for absolute value equations associated with circular cones
• A polynomial-time interior-point method for circular cone programming based on kernel functions
• The \(SC^1\) property of the squared norm of the SOC Fischer-Burmeister function
• A one-step smoothing Newton method for second-order cone programming
• Smoothing algorithms for complementarity problems over symmetric cones
• Applications of second-order cone programming
• Critical point theory and submanifold geometry
• Second-order cone programming
• A path following interior-point method for linear complementarity problems over circular cones
• The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems
• Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
• 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 non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
• Circular cone convexity and some inequalities associated with circular cones
• A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
• Primal-dual interior-point algorithms for convex quadratic circular cone optimization
• An infeasible full NT-step interior point method for circular optimization
• A nonsmooth version of Newton's method
• A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
• Parabolic second-order directional differentiability in the Hadamard sense of the vector-valued functions associated with circular cones
• Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
• Smoothing Functions for Second-Order-Cone Complementarity Problems
• A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search
• A nonmonotone smoothing Newton method for circular cone programming
• A non-interior continuation method for second-order cone programming
• Beyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems
• Variational analysis of circular cone programs
• A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
• The Jordan algebraic structure of the circular cone
• Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
• Constructions of complementarity functions and merit functions for circular cone complementarity problem

This page was built for publication: Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems.