Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints

DOI10.3934/JIMO.2021030zbMATH Open1499.90150OpenAlexW3127872418MaRDI QIDQ2673375FDOQ2673375

Lin Zhu, Xinzhen Zhang

Publication date: 9 June 2022

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2021030

zbMATH Keywords

polynomial optimizationsemidefinite relaxationLasserre's hierarchysecond-order cone complementarity

Mathematics Subject Classification ID

Semidefinite programming (90C22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Polynomial optimization (90C23)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Global optimization with polynomials and the problem of moments
• Second-order cone programming
• Smoothing functions for second-order-cone complementarity problems
• Optimality conditions and finite convergence of Lasserre's hierarchy
• A semidefinite approach for truncated \(K\)-moment problems
• Tensor eigenvalue complementarity problems
• Certifying convergence of Lasserre's hierarchy via flat truncation
• Polynomial optimization with real varieties
• First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints
• Necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
• Exact formulas for the proximal/regular/limiting normal cone of the second-order cone complementarity set
• A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
• Test of copositive tensors
• A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
• Mathematical programs with second-order cone complementarity constraints: strong stationarity and approximation method
• A semidefinite relaxation method for second-order cone polynomial complementarity problems
• SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection

Cited In (3)

• On polyhedral and second-order cone decompositions of semidefinite optimization problems
• Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling
• Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs

This page was built for publication: Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673375)