Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search

DOI10.1007/S11590-013-0699-1zbMATH Open1310.90110OpenAlexW2011695128MaRDI QIDQ479230FDOQ479230

Authors: Jingyong Tang, Li Dong, Liang Fang, Jinchuan Zhou 

Publication date: 5 December 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-013-0699-1

Recommendations

• Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming.
• A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search
• Analysis of smoothing-type algorithms for the convex second-order cone programming
• A new smoothing Newton-type method for second-order cone programming problems
• scientific article

zbMATH Keywords

convergencesecond-order cone programmingnonmonotone line searchsmoothing Newton algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Cites Work

• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A nonsmooth version of Newton's method
• Optimization and nonsmooth analysis
• Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
• Strongly Regular Generalized Equations
• Semismooth and Semiconvex Functions in Constrained Optimization
• 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
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• Smoothing functions for second-order-cone complementarity problems
• A non-interior continuation method for second-order cone programming
• 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 new smoothing Newton-type method for second-order cone programming problems
• A one-step smoothing Newton method for second-order cone programming
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
• A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems
• A truncated Newton method with non-monotone line search for unconstrained optimization
• A class on nonmonotone stabilization methods in unconstrained optimization
• A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
• Non-interior continuation methods for solving semidefinite complementarity problems
• Non-interior continuation method for solving the monotone semidefinite complementarity problem
• On the nonmonotone line search
• A new one-step smoothing Newton method for second-order cone programming.
• A survey on SOC complementarity functions and solution methods for SOCPs and SOCCPs
• A nonmonotone conjugate gradient algorithm for unconstrained optimization
• Nonsingularity conditions for FB system of reformulating nonlinear second-order cone programming
• A smoothing Newton-type method for second-order cone programming problems based on a new smoothing Fischer-Burmeister function
• A regularization Newton method for solving nonlinear complementarity problems
• Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
• Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
• Nonsingularity in second-order cone programming via the smoothing metric projector

Cited In (14)

• A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS
• A modified smoothing and regularized Newton method for monotone second-order cone complementarity problems
• Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP
• Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
• A one-step smoothing Newton method for second-order cone programming
• 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 non-monotone regularization Newton method for the second-order cone complementarity problem
• Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming.
• Title not available (Why is that?)
• A one-parametric class of smoothing functions and an improved regularization Newton method for the NCP
• A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search
• Improved convergence analysis of a smoothing Newton method for the circular cone programming
• Sub-quadratic convergence of a smoothing Newton method for second-order cone programming

Uses Software

• SDPT3

This page was built for publication: Smoothing Newton algorithm for the second-order 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 Q479230)