Semidefinite Relaxation Methods for Tensor Absolute Value Equations

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Multilinear algebra, tensor calculus (15A69) Numerical methods for matrix equations (65F45)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On some properties of three different types of triangular blocked tensors
Optimality conditions and finite convergence of Lasserre's hierarchy
The \(\mathcal A\)-truncated \(K\)-moment problem
Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
A generalized Newton method for absolute value equations associated with second order cones
A globally and quadratically convergent method for absolute value equations
Linear optimization with cones of moments and nonnegative polynomials
Solving tensor absolute value equation
Further study on tensor absolute value equations
Absolute value equations
Absolute value programming
A generalized Newton method for absolute value equations
Knapsack feasibility as an absolute value equation solvable by successive linear programming
Semidefinite characterization and computation of zero-dimensional real radical ideals
Geometric algorithms and combinatorial optimization.
A semidefinite approach for truncated \(K\)-moment problems
Nonemptiness and compactness of solution sets to generalized polynomial complementarity problems
Tensor absolute value equations
The existence and uniqueness of solution for tensor complementarity problem and related systems
On the solvability of tensor absolute value equations
A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations
The tensor splitting methods for solving tensor absolute value equation
Levenberg-Marquardt method for solving systems of absolute value equations
Finding Nash equilibrium for a class of multi-person noncooperative games via solving tensor complementarity problem
Two-person nonzero-sum games and quadratic programming
Certifying convergence of Lasserre's hierarchy via flat truncation
On equivalent reformulations for absolute value equations
Global Optimization with Polynomials and the Problem of Moments
Lectures on Modern Convex Optimization
Polynomial Optimization with Real Varieties
Positivity and Optimization for Semi-Algebraic Functions
Polynomial complementarity problems
GloptiPoly 3: moments, optimization and semidefinite programming
Multilinear PageRank
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Splitting methods for tensor equations
A theorem of the alternatives for the equationAx+B|x| =b
Sparse Polynomial Optimization
TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
Algebraic Degree of Polynomial Optimization
Relaxation methods for solving the tensor equation arising from the higher‐order Markov chains
Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Semidefinite Relaxation Methods for Tensor Absolute Value Equations