Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones
type: Item
instance of: scholarly article
title: Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones
zbMATH Open document ID: 1467.90080
author: Jingyong Tang
author: Jinchuan Zhou
published in: Annals of Operations Research
publication date: 2021-05-05T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 7344053
zbMATH Keywords: nonlinear complementarity problem
zbMATH Keywords: circular cones
zbMATH Keywords: smoothing function
zbMATH Keywords: inexact Newton method
zbMATH Keywords: superlinear/quadratical convergence
describes a project that uses: SCCP
MaRDI profile type: Publication
full work available at URL: s10479-020-03773-8
OpenAlex ID: W3081925277
cites work: The Jordan algebraic structure of the circular cone
cites work: Primal-dual interior-point algorithms for convex quadratic circular cone optimization
cites work: A polynomial-time interior-point method for circular cone programming based on kernel functions
cites work: A one-parametric class of merit functions for the second-order cone complementarity problem
cites work: Q4906119
cites work: A nonmonotone smoothing Newton method for circular cone programming
cites work: Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
cites work: Inexact Newton Methods
cites work: Numerical study of a smoothing algorithm for the complementarity system over the second-order cone
cites work: Smoothing functions for second-order-cone complementarity problems
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
cites work: Smoothing algorithms for complementarity problems over symmetric cones
cites work: Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
cites work: On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
cites work: The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems
cites work: An infeasible full NT-step interior point method for circular optimization
cites work: Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
cites work: A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
cites work: A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
cites work: A generalized smoothing Newton method for the symmetric cone complementarity problem
cites work: A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
cites work: A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems
cites work: A regularized smoothing Newton method for solving the symmetric cone complementarity problem
cites work: Q2953984
cites work: Constructions of complementarity functions and merit functions for circular cone complementarity problem
cites work: A generalized Newton method for absolute value equations associated with circular cones
cites work: A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems
cites work: A path following interior-point method for linear complementarity problems over circular cones
cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
cites work: A nonsmooth version of Newton's method
cites work: Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
cites work: A smoothing Newton method for symmetric cone complementarity problems
cites work: Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP
cites work: Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
cites work: A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
cites work: Q5495616
cites work: Circular cone convexity and some inequalities associated with circular cones
cites work: Variational analysis of circular cone programs
cites work: Parabolic second-order directional differentiability in the Hadamard sense of the vector-valued functions associated with circular cones
DOI: 10.1007/S10479-020-03773-8
description: scientific article; zbMATH DE number 7344053