Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
From MaRDI portal
Publication:479230
DOI10.1007/s11590-013-0699-1zbMath1310.90110OpenAlexW2011695128MaRDI QIDQ479230
Li Dong, Jingyong Tang, Liang Fang, Jin Chuan 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
Related Items
Nonmonotone smoothing inexact Newton method for the nonlinear complementarity problem, Improved convergence analysis of a smoothing Newton method for the circular cone programming, A non-monotone regularization Newton method for the second-order cone complementarity problem, Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP, Numerical study of a smoothing algorithm for the complementarity system over the second-order cone, A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS, A one-parametric class of smoothing functions and an improved regularization Newton method for the NCP
Uses Software
Cites Work
- Unnamed Item
- 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
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
- 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
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- A new one-step smoothing Newton method for second-order cone programming.
- A new smoothing Newton-type method for second-order cone programming problems
- A one-step smoothing Newton method for second-order cone programming
- Nonsingularity in second-order cone programming via the smoothing metric projector
- A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Applications of second-order cone programming
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Non-interior continuation methods for solving semidefinite complementarity problems
- Non-interior continuation method for solving the monotone semidefinite complementarity problem
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- Second-order cone programming
- A regularization Newton method for solving nonlinear complementarity problems
- 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 class on nonmonotone stabilization methods in unconstrained optimization
- A nonsmooth version of Newton's method
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems
- A non-interior continuation method for second-order cone programming
- 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 and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- On the nonmonotone line search
