Solvability of Newton equations in smoothing-type algorithms for the SOCCP
From MaRDI portal
Publication:629483
DOI10.1016/j.cam.2010.10.025zbMath1215.65110OpenAlexW2009830986MaRDI QIDQ629483
Publication date: 9 March 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.10.025
smoothing-type algorithmsecond-order cone complementarity problem (SOCCP)solvability of Newton equations
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities
- A regularized smoothing-type algorithm for solving a system of inequalities with a \(P_{0}\)-function
- A smoothing-type algorithm for solving system of inequalities
- A smoothing method for second order cone complementarity problem
- Analysis of a smoothing Newton method for second-order cone complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A continuation method for (strongly) monotone variational inequalities
- Improved smoothing-type methods for the solution of linear programs
- 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
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
