A semidefinite relaxation method for linear and nonlinear complementarity problems with polynomials
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- scientific article; zbMATH DE number 3201668 (Why is no real title available?)
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- A class of smoothing functions for nonlinear and mixed complementarity problems
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- A penalized Fischer-Burmeister NCP-function
- A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
- A semidefinite method for tensor complementarity problems
- A smoothing Newton method for general nonlinear complementarity problems
- A special newton-type optimization method
- A two-level additive Schwarz method for a kind of tensor complementarity problem
- An index detecting algorithm for a class of TCP \((\mathcal{A},q)\) equipped with nonsingular \(\mathcal{M}\)-tensors
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Connectedness of the solution set of the tensor complementarity problem
- Convex sets with semidefinite representation
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Estimations on upper and lower bounds of solutions to a class of tensor complementarity problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- Global optimization with polynomials and the problem of moments
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Interior-point methods
- Interior-point methods for nonlinear complementarity problems
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- Modified proximal-point method for nonlinear complementarity problems
- Modulus-based matrix splitting iteration methods for linear complementarity problems.
- Modulus-based synchronous two-stage multisplitting iteration methods for linear complementarity problems
- Monotone Operators and the Proximal Point Algorithm
- On NCP-functions
- On copositive matrices with -1, 9, 1 entries
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Positive-definite tensors to nonlinear complementarity problems
- Properties of solution set of tensor complementarity problem
- Properties of tensor complementarity problem and some classes of structured tensors
- Semidefinite Optimization and Convex Algebraic Geometry
- Semidefinite representation of convex sets
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- Strictly semi-positive tensors and the boundedness of tensor complementarity problems
- Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
- Tensor complementarity problems. I: Basic theory
- Tensor complementarity problems. III: Applications
- The \(\mathcal A\)-truncated \(K\)-moment problem
- The split feasibility problem with polynomials
- \(\mathrm{P}\)-tensors, \(\mathrm{P}_0\)-tensors, and their applications
This page was built for publication: A semidefinite relaxation method for linear and nonlinear complementarity problems with polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977497)
