An efficient algorithm for second-order cone linear complementarity problems
From MaRDI portal
Recommendations
- An efficient matrix splitting method for the second-order cone complementarity problem
- An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem
- An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
- An approximate lower order penalty approach for solving second-order cone linear complementarity problems
- Linear complementarity problems on extended second order cones
- A linearly convergent derivative-free descent method for the second-order cone complementarity problem
- A variant of the simplex method for second-order cone programming
- An inexact smoothing algorithm for linear second-order cone complementarity problems
- A lower order penalty method for second-order cone linear complementarity problems
- An alternating direction method for second-order conic programming
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 108341 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- A damped Gauss-Newton method for the second-order cone complementarity problem
- A descent method for a reformulation of the second-order cone complementarity problem
- A matrix-splitting method for symmetric affine second-order cone complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- ARPACK Users' Guide
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Matrix algorithms. Vol. 2: Eigensystems
- Numerical Methods for Quasi‐Linear Elliptic Equations with Nonlinear Boundary Conditions
- On semidefinite linear complementarity problems
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- Smoothing algorithms for complementarity problems over symmetric cones
- Smoothing functions for second-order-cone complementarity problems
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Some P-properties for linear transformations on Euclidean Jordan algebras
- The GUS-property of second-order cone linear complementarity problems
- The Newton-Kantorovich Theorem
- The global linear convergence of a noninterior path-following algorithm for linear complementarity problems
- Variational inequalities over the cone of semidefinite positive symmetric matrices and over the Lorentz cone
Cited in
(17)- A conical algorithm for solving a class of complementarity problems
- An approximate lower order penalty approach for solving second-order cone linear complementarity problems
- On matrix characterizations for \(P\)-property of the linear transformation in second-order cone linear complementarity problems
- A Krylov subspace method for large-scale second-order cone linear complementarity problem
- A descent method for a reformulation of the second-order cone complementarity problem
- A proximal point algorithm for the monotone second-order cone complementarity problem
- The parameter-Newton iteration for the second-order cone linear complementarity problem
- A generalized two-step modulus-based matrix splitting iteration method for implicit complementarity problems of H_+-matrices
- A preconditioned general two-step modulus-based matrix splitting iteration method for linear complementarity problems of \(H_+\)-matrices
- scientific article; zbMATH DE number 2013209 (Why is no real title available?)
- Solving symmetric and positive definite second-order cone linear complementarity problem by a rational Krylov subspace method
- An efficient numerical method for the symmetric positive definite second-order cone linear complementarity problem
- The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
- On the range of the pseudomonotone second-order cone linear complementarity problem
- Solution analysis for the pseudomonotone second-order cone linear complementarity problem
- The GUS-property of second-order cone linear complementarity problems
- A feasible direction algorithm for nonlinear second-order cone programs
This page was built for publication: An efficient algorithm for second-order cone linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5418485)
