A new smoothing Newton-type method for second-order cone programming problems
From MaRDI portal
Publication:734859
DOI10.1016/j.amc.2009.06.029zbMath1183.65065OpenAlexW2044488961MaRDI QIDQ734859
Liang Fang, Yunhong Hu, Guo-Ping 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
interior-point methodnumerical examplessmoothing methodsecond-order cone programming\(Q\)-quadratic convergence
Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51)
Related Items
A new non-interior continuation method for solving the second-order cone complementarity problem ⋮ Jacobian consistency of a one-parametric class of smoothing Fischer-Burmeister functions for SOCCP ⋮ A smoothing Newton method for the second-order cone complementarity problem. ⋮ Improved convergence analysis of a smoothing Newton method for the circular cone programming ⋮ A smoothing Newton method for second-order cone optimization based on a new smoothing function ⋮ Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations ⋮ Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search ⋮ Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming. ⋮ A smoothing Newton method based on a one-parametric class of smoothing function for SOCCP ⋮ 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 ⋮ The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem ⋮ A one-parametric class of smoothing functions for second-order cone programming ⋮ Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects ⋮ Analysis of smoothing-type algorithms for the convex second-order cone programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of a smoothing method for symmetric conic linear programming
- Two classes of merit functions for the second-order cone complementarity problem
- Applications of second-order cone programming
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- Interior point methods for second-order cone programming and OR applications
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions
- A nonsmooth version of Newton's method
- The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- An efficient support vector machine learning method with second-order cone programming for large-scale problems
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Semismooth and Semiconvex Functions in Constrained Optimization
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Optimal Magnetic Shield Design with Second-Order Cone Programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- 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
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Contact Analysis of Cable Networks by Using Second-Order Cone Programming