Global and global linear convergence of smoothing algorithm for the Cartesian P_*()-SCLCP
From MaRDI portal
Publication:2358845
Recommendations
- Smoothing Newton methods for symmetric cone linear complementarity problem with the Cartesian P/P₀-property
- A smoothing Newton method for the Cartesian P₀-LCP over symmetric cones
- Smoothing algorithms for complementarity problems over symmetric cones
- On the \(P_*(\kappa)\) horizontal linear complementarity problems over Cartesian product of symmetric cones
- The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem
Cites work
- \(P_ *\)-matrices are just sufficient
- A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P0LCPs
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A new path-following algorithm for nonlinear P_* complementarity problems
- A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties
- A one-parametric class of merit functions for the symmetric cone complementarity problem
- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Analysis of a smoothing method for symmetric conic linear programming
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
- Convergence properties of a non-interior-point smoothing algorithm for the \(P*\)NCP
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
- Pseudo-monotone complementarity problems in Hilbert space
- Smoothing algorithms for complementarity problems over symmetric cones
- Some P-properties for linear transformations on Euclidean Jordan algebras
- Sub-quadratic convergence of a smoothing Newton algorithm for the P₀- and monotone LCP
- The Fischer-Burmeister complementarity function on Euclidean Jordan algebras
- The global linear and local quadratic convergence of a non-interior continuation algorithm for the LCP
Cited in
(3)- Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem
- Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
- A regularization smoothing Newton method for the symmetric cone complementarity problem with the Cartesian P₀-property
This page was built for publication: Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358845)
