The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem
From MaRDI portal
Publication:2511397
DOI10.1007/s12190-013-0665-1zbMath1326.90089OpenAlexW1966794100MaRDI QIDQ2511397
Jingyong Tang, Li Dong, Liang Fang, Jin Chuan Zhou
Publication date: 5 August 2014
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-013-0665-1
convergencesmoothing functionEuclidean Jordan algebrasmoothing Newton methodsymmetric cone complementarity problem
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A new smoothing and regularization Newton method for the symmetric cone complementarity problem, A new nonmonotone smoothing Newton method for the symmetric cone complementarity problem with the Cartesian \(P_0\)-property, Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP, A nonmonotone smoothing Newton algorithm for weighted complementarity problem
Uses Software
Cites Work
- 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 for second-order cone optimization based on a new smoothing function
- Some P-properties for linear transformations on Euclidean Jordan algebras
- A new smoothing Newton-type method for second-order cone programming problems
- Analysis of a non-interior continuation method for second-order cone programming
- A one-step smoothing Newton method for second-order cone programming
- Smoothing algorithms for complementarity problems over symmetric cones
- A smoothing method for second order cone complementarity problem
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
- Applications of second-order cone programming
- Critical point theory and submanifold geometry
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A nonsmooth version of Newton's method
- Extension of smoothing functions to symmetric cone complementarity problems
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- A new one-step smoothing newton method for the second-order cone complementarity problem
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
- Beyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
