A new smoothing Newton-type method for second-order cone programming problems
From MaRDI portal
Publication:734859
DOI10.1016/J.AMC.2009.06.029zbMATH Open1183.65065OpenAlexW2044488961MaRDI QIDQ734859FDOQ734859
Authors: Liang Fang, Yunhong Hu, Guoping He 
Publication date: 14 October 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.06.029
Recommendations
- A new one-step smoothing Newton method for second-order cone programming.
- A smoothing-type Newton method for second-order cone programming problems based on a new smooth function
- Sub-quadratic convergence of a smoothing Newton method for second-order cone programming
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- scientific article
numerical examplessecond-order cone programmingsmoothing methodinterior-point method\(Q\)-quadratic convergence
Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Title not available (Why is that?)
- Title not available (Why is that?)
- A nonsmooth version of Newton's method
- Semismooth and Semiconvex Functions in Constrained Optimization
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- Applications of second-order cone programming
- Second-order cone programming
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing functions for second-order-cone complementarity problems
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions
- The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- An efficient support vector machine learning method with second-order cone programming for large-scale problems
- Second order cone programming approaches for handling missing and uncertain data
- Interior point methods for second-order cone programming and OR applications
- Two classes of merit functions for the second-order cone complementarity problem
- Title not available (Why is that?)
- Analysis of a smoothing method for symmetric conic linear programming
- Contact Analysis of Cable Networks by Using Second-Order Cone Programming
- Optimal Magnetic Shield Design with Second-Order Cone Programming
Cited In (23)
- Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects
- A new non-interior continuation method for solving the second-order cone complementarity problem
- A smoothing Newton method for the second-order cone complementarity problem.
- A globally and quadratically convergent smoothing Newton method for solving second-order cone optimization
- A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- A smoothing Newton method for second-order cone optimization based on a new smoothing function
- A smoothing-type Newton method for second-order cone programming problems based on a new smooth function
- A smoothing Newton method based on a one-parametric class of smoothing function for SOCCP
- A one-step smoothing Newton method for second-order cone programming
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- Jacobian consistency of a one-parametric class of smoothing Fischer-Burmeister functions for SOCCP
- Analysis of smoothing-type algorithms for the convex second-order cone programming
- Title not available (Why is that?)
- A one-parametric class of smoothing functions for second-order cone programming
- Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming.
- Title not available (Why is that?)
- Analysis of a smoothing Newton method for second-order cone complementarity problem
- The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem
- Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations
- A predictor-corrector smoothing method for second-order cone programming
- 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
This page was built for publication: A new smoothing Newton-type method for second-order cone programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734859)
