A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search
DOI10.1080/02331934.2014.906595zbMATH Open1337.90071OpenAlexW2059416032MaRDI QIDQ2808327FDOQ2808327
Authors: Jingyong Tang, Li Dong, Li Sun, Jinchuan Zhou
Publication date: 23 May 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.906595
Recommendations
- scientific article
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems
- Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming.
- A new non-interior continuation method for solving the second-order cone complementarity problem
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Critical point theory and submanifold geometry
- A nonsmooth version of Newton's method
- Semismooth and Semiconvex Functions in Constrained Optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- A Nonmonotone Line Search Technique for Newton’s Method
- Applications of second-order cone programming
- Second-order cone programming
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
- Smoothing functions for second-order-cone complementarity problems
- Three-dimensional quasi-static frictional contact by using second-order cone linear complementarity problem
- A smoothing Newton method for the second-order cone complementarity problem.
- A non-interior continuation method for second-order cone programming
- A regularized smoothing Newton method for solving the symmetric cone complementarity problem
- 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
- A smoothing Newton method for second-order cone optimization based on a new smoothing function
- 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 new one-step smoothing Newton method for the second-order cone complementarity problem
- A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems
- A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
- A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems
- The \(SC^1\) property of the squared norm of the SOC Fischer-Burmeister function
- Beyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems
- A regularization Newton method for solving nonlinear complementarity problems
- Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
Cited In (17)
- A smoothing quasi-Newton method for solving general second-order cone complementarity problems
- Predictor-corrector inexact smoothing algorithm for symmetric cone complementarity problems with Cartesian \(P_0\)-property
- A regularization Newton method based on the generalized Fischer-Burmeister smoothing function for the NCP
- Title not available (Why is that?)
- An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization
- A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems
- Improved convergence results for an inexact smoothing method for the second-order cone complementarity problem
- Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP
- Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems.
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
- Numerical study of a smoothing algorithm for the complementarity system over the second-order cone
- Nonmonotone smoothing inexact Newton method for the nonlinear complementarity problem
- A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
- A nonmonotone smoothing Newton method for circular cone programming
- A new smoothing and regularization Newton method for the symmetric cone complementarity problem
- A one-parametric class of smoothing functions and an improved regularization Newton method for the NCP
- A smooth Newton method with 3-1 piecewise NCP function for generalized nonlinear complementarity problem
This page was built for publication: A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808327)