Improved convergence analysis of a smoothing Newton method for the circular cone programming
From MaRDI portal
Publication:5090294
DOI10.1080/02331934.2020.1847108zbMath1495.90106OpenAlexW3108099141MaRDI QIDQ5090294
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
Semidefinite programming (90C22) Convex programming (90C25) Nonlinear programming (90C30) Linear programming (90C05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A smoothing Newton-type method for second-order cone programming problems based on a new smoothing Fischer-Burmeister function
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- A smoothing Newton method for second-order cone optimization based on a new smoothing function
- A generalized Newton method for absolute value equations associated with circular cones
- 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 polynomial-time interior-point method for circular cone programming based on kernel functions
- A one-step smoothing Newton method for second-order cone programming
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
- A path following interior-point method for linear complementarity problems over circular cones
- The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems
- Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- 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
- From robot to human grasping simulation
- 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 non-interior continuation method for second-order cone programming
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Variational analysis of circular cone programs
- Constructions of complementarity functions and merit functions for circular cone complementarity problem
