Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones

DOI10.1007/S10479-020-03773-8MaRDI QIDQ828835zbMATH OpenOpenAlexFDO

Authors Jingyong Tang, Jinchuan Zhou

Publication date 5 May 2021

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-020-03773-8

zbMATH Keywords

nonlinear complementarity problemsmoothing functioninexact Newton methodcircular conessuperlinear/quadratical convergence

Mathematics Subject Classification ID

Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A nonmonotone inexact smoothing Newton method for linear circular cone complementarity problems
• A nonmonotone smoothing Newton method for circular cone programming
• Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
• Improved convergence analysis of a smoothing Newton method for the circular cone programming
• Nonmonotone smoothing inexact Newton method for the nonlinear complementarity problem

Cites work

• scientific article; zbMATH DE number 6325420 (Why is no real title available?)
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
• A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
• A generalized Newton method for absolute value equations associated with circular cones
• A generalized smoothing Newton method for the symmetric cone complementarity problem
• A nonmonotone smoothing Newton method for circular cone programming
• A nonsmooth version of Newton's method
• A one-parametric class of merit functions for the second-order cone complementarity problem
• 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 smoothing Newton method for solving the symmetric cone complementarity problem
• A self-concordant interior point algorithm for nonsymmetric circular cone programming
• A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
• A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems
• A smoothing Newton method for symmetric cone complementarity problems
• A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems
• A survey on SOC complementarity functions and solution methods for SOCPs and SOCCPs
• An infeasible full NT-step interior point method for circular optimization
• Circular cone convexity and some inequalities associated with circular cones
• Constructions of complementarity functions and merit functions for circular cone complementarity problem
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
• Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Inexact Newton Methods
• Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
• Numerical study of a smoothing algorithm for the complementarity system over the second-order cone
• On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
• 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
• Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
• 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 convergence properties of a modified nonmonotone smoothing algorithm for the SCCP
• Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
• The Jordan algebraic structure of the circular cone
• The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems
• Variational analysis of circular cone programs

Cited in

(8)

• Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
• A nonmonotone inexact smoothing Newton method for linear circular cone complementarity problems
• A two-step Broyden-like method for nonlinear equations
• A nonmonotone smoothing Newton method for circular cone programming
• A projection recurrent neural network method for solving absolute value equations associated with second-order cones
• A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI
• An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems
• Improved convergence analysis of a smoothing Newton method for the circular cone programming

Describes a project that uses

Uses Software

• SCCP

This page was built for publication: Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones

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