A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
From MaRDI portal
Publication:3395003
DOI10.1137/060676775zbMath1182.65092OpenAlexW2095500353MaRDI QIDQ3395003
Lingchen Kong, Jie Sun, Nai-Hua Xiu
Publication date: 20 August 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11937/46475
algorithmmonotonicityquadratic convergencesymmetric cone complementarity problemnatural residual functionJacobian consistencyChen-Mangasarian smoothing functionJacobian nonsingularityregularized smoothing Newton method
Numerical mathematical programming methods (65K05) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A smoothing iterative method for quantile regression with nonconvex \(\ell_p\) penalty ⋮ Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP ⋮ Unified smoothing functions for absolute value equation associated with second-order cone ⋮ An inexact smoothing method for the monotone complementarity problem over symmetric cones ⋮ Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones ⋮ Clarke generalized Jacobian of the projection onto symmetric cones ⋮ A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS ⋮ Properties of a Class of Nonlinear Transformations Over Euclidean Jordan Algebras with Applications to Complementarity Problems ⋮ Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones ⋮ An alternative approach for a distance inequality associated with the second-order cone and the circular cone ⋮ A generalized smoothing Newton method for the symmetric cone complementarity problem ⋮ Convergence of a non-interior continuation algorithm for the monotone SCCP ⋮ The GUS-property of second-order cone linear complementarity problems ⋮ A new smoothing and regularization Newton method for the symmetric cone complementarity problem ⋮ Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity ⋮ A predictor-corrector smoothing Newton method for symmetric cone complementarity problems ⋮ Stationary point conditions for the FB merit function associated with symmetric cones ⋮ A semismooth Newton method for nonlinear symmetric cone programming ⋮ A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones ⋮ Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions ⋮ Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems ⋮ A smoothing-type algorithm for solving inequalities under the order induced by a symmetric cone ⋮ A new nonmonotone smoothing Newton method for the symmetric cone complementarity problem with the Cartesian \(P_0\)-property ⋮ Sparse recovery on Euclidean Jordan algebras ⋮ An algorithm for a class of nonlinear complementarity problems with non-Lipschitzian functions ⋮ A homogeneous smoothing-type algorithm for symmetric cone linear programs ⋮ Smoothing method for mathematical programs with symmetric cone complementarity constraints ⋮ On matrix characterizations for \(P\)-property of the linear transformation in second-order cone linear complementarity problems ⋮ A generalized Newton method for absolute value equations associated with circular cones ⋮ Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP ⋮ A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems ⋮ Improved smoothing Newton methods for symmetric cone complementarity problems ⋮ The same growth of FB and NR symmetric cone complementarity functions ⋮ Complementarity properties of the Lyapunov transformation over symmetric cones ⋮ An efficient algorithm for second-order cone linear complementarity problems ⋮ Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming ⋮ Extension of smoothing Newton algorithms to solve linear programming over symmetric cones ⋮ On merit functions for \(p\)-order cone complementarity problem ⋮ A smoothing Newton method for absolute value equation associated with second-order cone ⋮ An inexact modified Newton method for VISCC and application in grasping force ⋮ Constructions of complementarity functions and merit functions for circular cone complementarity problem ⋮ An inexact semismooth Newton method for variational inequality with symmetric cone constraints ⋮ Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects ⋮ A nonmonotone smoothing Newton algorithm for weighted complementarity problem ⋮ A one-parametric class of merit functions for the symmetric cone complementarity problem ⋮ Predictor-corrector inexact smoothing algorithm for symmetric cone complementarity problems with Cartesian \(P_0\)-property ⋮ Growth behavior of two classes of merit functions for symmetric cone complementarity problems ⋮ An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem ⋮ A projection and contraction method for symmetric cone complementarity problem ⋮ An alternating direction method for solving convex nonlinear semidefinite programming problems ⋮ Three classes of merit functions for the complementarity problem over a closed convex cone ⋮ Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search ⋮ A smoothing Newton method with a mixed line search for monotone weighted complementarity problems ⋮ A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem ⋮ A smoothing Newton method for symmetric cone complementarity problem
Uses Software
