A new one-step smoothing newton method for the second-order cone complementarity problem
From MaRDI portal
Publication:3069969
DOI10.1002/mma.1366zbMath1230.90150OpenAlexW1996038042MaRDI QIDQ3069969
Publication date: 2 February 2011
Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mma.1366
global convergencecoercivenesssmoothing Newton methodJordan productsecond-order cone complementarity
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Programming in abstract spaces (90C48) Complexity and performance of numerical algorithms (65Y20)
Related Items (16)
An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function ⋮ The parameter-Newton iteration for the second-order cone linear complementarity problem ⋮ The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems ⋮ A generalized smoothing Newton method for the symmetric cone complementarity problem ⋮ The matrix splitting iteration method for nonlinear complementarity problems associated with second-order cone ⋮ A two-parametric class of merit functions for the second-order cone complementarity problem ⋮ The models of bilevel programming with lower level second-order cone programs ⋮ Anderson accelerating the preconditioned modulus approach for linear complementarity problems on second-order cones ⋮ The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems ⋮ A non-monotone regularization Newton method for the second-order cone complementarity problem ⋮ A globally and quadratically convergent smoothing Newton method for solving second-order cone optimization ⋮ The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem ⋮ A modified LM algorithm for tensor complementarity problems over the circular cone ⋮ A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search ⋮ SOR-Like Iteration Methods for Second-Order Cone Linear Complementarity Problems ⋮ A new smoothing method for solving nonlinear complementarity problems
Cites Work
- A damped Gauss-Newton method for the second-order cone complementarity problem
- Non-interior continuation methods for solving semidefinite complementarity problems
- Second-order cone programming
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions
- A nonsmooth version of Newton's method
- A descent method for a reformulation of the second-order cone complementarity problem
- The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function
- On P- and S-functions and related classes of \(n\)-dimensional nonlinear mappings
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- Semismooth and Semiconvex Functions in Constrained Optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Unnamed Item
This page was built for publication: A new one-step smoothing newton method for the second-order cone complementarity problem
