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

DOI10.1016/S0252-9602(17)30072-3MaRDI QIDQ1752086zbMATH OpenOpenAlexWikidataFDO

Authors Xiaoni Chi, Hongjin, Zhongping Wan, Zhibin Zhu

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

circular cone programminglocal quadratic convergencenonmonotone line searchsecond-order cone programmingsmoothing Newton method

Mathematics Subject Classification ID

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

Recommendations

• A nonmonotone smoothing Newton method for circular cone programming
• A smoothing Newton algorithm for circular cone programming
• A smoothing Newton algorithm for circular cone programming
• A nonmonotone inexact smoothing Newton method for linear circular cone complementarity problems
• Smoothing Newton method for linear circular cone complementarity problems
• Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
• Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones
• A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems
• Improved convergence analysis of a smoothing Newton method for the circular cone programming
• A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems

Cited in

(11)

• Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems.
• An efficient nonmonotone method for state-constrained elliptic optimal control problems
• An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems
• A nonmonotone smoothing Newton method for circular cone programming
• A smoothing Newton algorithm for circular cone programming
• Improved convergence analysis of a smoothing Newton method for the circular cone programming
• A new non-interior point algorithm for circular cone programming
• A smoothing Newton algorithm for circular cone programming
• The solvability of weighted complementarity problems and a smoothing Newton algorithm under the local error bound
• Expected value method for a class of stochastic linear circular cone complementarity problems
• Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752086)