Improved convergence analysis of a smoothing Newton method for the circular cone programming

DOI10.1080/02331934.2020.1847108MaRDI QIDQ5090294zbMATH OpenOpenAlexFDO

Authors Jingyong Tang, Jinchuan Zhou

Publication date 18 July 2022

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2020.1847108

zbMATH Keywords

circular cone programmingderivative-free line searchquadratical convergencesmoothing Newton method

Mathematics Subject Classification ID

Linear programming (90C05) Semidefinite programming (90C22) Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• A nonmonotone smoothing Newton method for circular cone programming
• A smoothing Newton algorithm for circular cone programming
• Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
• A smoothing Newton algorithm for circular cone programming
• Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones

Cites work

• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• 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 new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A new one-step smoothing Newton method for second-order cone programming.
• A new smoothing Newton-type method for second-order cone programming problems
• A non-interior continuation method for second-order cone programming
• 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 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 method for second-order cone optimization based on a new smoothing function
• A smoothing Newton-type method for second-order cone programming problems based on a new smoothing Fischer-Burmeister function
• 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
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• From robot to human grasping simulation
• scientific article; zbMATH DE number 6325420 (Why is no real title available?)
• 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
• Smoothing functions for second-order-cone complementarity problems
• Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
• Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
• Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
• The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems
• Variational analysis of circular cone programs

Cited in

(6)

• Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
• A nonmonotone smoothing Newton method for circular cone programming
• A smoothing Newton algorithm for circular cone programming
• A smoothing Newton algorithm for circular cone programming
• Expected value method for a class of stochastic linear circular cone complementarity problems
• Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones

This page was built for publication: Improved convergence analysis of a smoothing Newton method for the circular cone programming

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