A Krylov subspace method for large-scale second-order cone linear complementarity problem
From MaRDI portal
linear complementarity problemmodel reductionsecond-order coneKrylov subspaceglobally uniquely solvable propertyGUSLCPvAlinear complementarity problem via Arnoldi processsoclcp
Numerical mathematical programming methods (65K05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical linear algebra (65F99) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical problems in dynamical systems (65P99)
Recommendations
- 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
- An efficient algorithm for second-order cone linear complementarity problems
- The parameter-Newton iteration for the second-order cone linear complementarity problem
- An efficient matrix splitting method for the second-order cone complementarity problem
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 491265 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (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 Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- 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 new matrix-free algorithm for the large-scale trust-region subproblem
- A new method for solving second-order cone eigenvalue complementarity problems
- A variational approach to copositive matrices
- Algorithm 873
- An active-set method for second-order conic-constrained quadratic programming
- An algorithm for the fast solution of symmetric linear complementarity problems
- An efficient algorithm for second-order cone linear complementarity problems
- An efficient matrix splitting method for the second-order cone complementarity problem
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Applications of second-order cone programming
- Asymptotic waveform evaluation via a Lanczos method
- 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
- Dimension Reduction of Large-Scale Second-Order Dynamical Systems via a Second-Order Arnoldi Method
- Error estimation on the Padé approximation of transfer functions via the Lanczos process
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Handbook on semidefinite, conic and polynomial optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Model order reduction: Theory, research aspects and applications. Selected papers based on the presentations at the workshop `Model order reduction, coupled problems and optimization', Leiden, The Netherlands, September 19--23, 2005.
- Multiplier and gradient methods
- Numerical Methods for Quasi‐Linear Elliptic Equations with Nonlinear Boundary Conditions
- On eigenvalues induced by a cone constraint.
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- Positive operators on the \(n\)-dimensional ice cream cone
- Product-form Cholesky factorization in interior point methods for second-order cone programming
- Quadratic optimization over a second-order cone with linear equality constraints
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
- Second-order cone programming
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- Simultaneous similarity reductions for a pair of matrices to condensed forms
- Smoothing algorithms for complementarity problems over symmetric cones
- Smoothing functions for second-order-cone complementarity problems
- Solving inverse cone-constrained eigenvalue problems
- Solving semidefinite-quadratic-linear programs using SDPT3
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Some P-properties for linear transformations on Euclidean Jordan algebras
- Structure-preserving model reduction using a Krylov subspace projection formulation
- The GUS-property of second-order cone linear complementarity problems
- The global linear convergence of a noninterior path-following algorithm for linear complementarity problems
- Trace minimization principles for positive semi-definite pencils
- Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Variational inequalities over the cone of semidefinite positive symmetric matrices and over the Lorentz cone
Cited in
(11)- Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems
- On matrix characterizations for \(P\)-property of the linear transformation in second-order cone linear complementarity problems
- A Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality Constraints
- The parameter-Newton iteration for the second-order cone linear complementarity problem
- \(H_2\) optimal model order reduction of the discrete system on the product manifold
- A preconditioned general two-step modulus-based matrix splitting iteration method for linear complementarity problems of \(H_+\)-matrices
- 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
This page was built for publication: A Krylov subspace method for large-scale second-order cone linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502096)
