Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems.

DOI10.21136/AM.2021.0129-20MaRDI QIDQ2128412zbMATH OpenOpenAlexFDO

Authors 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 algorithmsmoothing functioncircular cone complementarity problemsuperlinear/quadratical convergence

Mathematics Subject Classification ID

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

Recommendations

• A smoothing Newton method for symmetric cone complementarity problem
• The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem
• A nonmonotone inexact smoothing Newton method for linear circular cone complementarity problems
• Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
• A regularized inexact smoothing Newton method for circular cone complementarity problem

Cites work

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

Cited in

(2)

• Extension of smoothing functions to symmetric cone complementarity problems
• A Levenberg-Marquardt type algorithm with a Broyden-like update technique for solving nonlinear equations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128412)