Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search

DOI10.1016/S0252-9602(17)30072-3zbMath1399.90207OpenAlexW2742725099WikidataQ115027839 ScholiaQ115027839MaRDI QIDQ1752086

Xiaoni Chi, Hongjin, Zhi Bin Zhu, Zhong-Ping Wan

Publication date: 25 May 2018

Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0252-9602(17)30072-3

zbMATH Keywords

nonmonotone line searchlocal quadratic convergencesecond-order cone programmingsmoothing Newton methodcircular cone programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (5)

Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems. ⋮ Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones ⋮ Improved convergence analysis of a smoothing Newton method for the circular cone programming ⋮ An efficient nonmonotone method for state-constrained elliptic optimal control problems ⋮ An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems

This page was built for publication: Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search