Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones
From MaRDI portal
Publication:828835
DOI10.1007/s10479-020-03773-8zbMath1467.90080OpenAlexW3081925277MaRDI QIDQ828835
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
nonlinear complementarity probleminexact Newton methodsmoothing functioncircular conessuperlinear/quadratical convergence
Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (2)
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A regularized smoothing Newton method for solving the symmetric cone complementarity problem
- Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
- A smoothing Newton method with Fischer-Burmeister function for 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
- Smoothing algorithms for complementarity problems over symmetric cones
- A one-parametric class of merit functions for the second-order cone complementarity problem
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
- A path following interior-point method for linear complementarity problems over circular cones
- A generalized smoothing Newton method for the symmetric cone complementarity problem
- The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems
- Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP
- Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- Numerical study of a smoothing algorithm for the complementarity system over the second-order cone
- A smoothing Newton method for symmetric cone complementarity problems
- A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems
- Circular cone convexity and some inequalities associated with circular cones
- 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
- 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 nonmonotone smoothing Newton method for circular cone programming
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- Inexact Newton Methods
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Variational analysis of circular cone programs
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- 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 inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones
