Pages that link to "Item:Q403636"
From MaRDI portal
The following pages link to Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636):
Displayed 48 items.
- Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools (Q2418156) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
- Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints (Q2673375) (← links)
- Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (Q2678586) (← links)
- Convex generalized Nash equilibrium problems and polynomial optimization (Q2693649) (← links)
- An effective version of Schmüdgen's Positivstellensatz for the hypercube (Q2693779) (← links)
- The CP-Matrix Approximation Problem (Q2790067) (← links)
- Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes (Q2804545) (← links)
- Positive Maps and Separable Matrices (Q2810548) (← links)
- Exact Algorithms for Linear Matrix Inequalities (Q2834563) (← links)
- A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis (Q3296188) (← links)
- Qualification Conditions in Semialgebraic Programming (Q4571881) (← links)
- Real Radicals and Finite Convergence of Polynomial Optimization Problems (Q4604742) (← links)
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables (Q4637505) (← links)
- LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
- Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension (Q5148406) (← links)
- A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization (Q5158762) (← links)
- Best Nonnegative Rank-One Approximations of Tensors (Q5203971) (← links)
- Stochastic polynomial optimization (Q5210742) (← links)
- A mixed PI/VI design method for nonlinear <i>H</i><sub><i><b>∞</b></i></sub> Control (Q5212481) (← links)
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization (Q5233101) (← links)
- Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP (Q5242927) (← links)
- Bilevel Polynomial Programs and Semidefinite Relaxation Methods (Q5348472) (← links)
- Generic Properties for Semialgebraic Programs (Q5363376) (← links)
- Symmetric Tensor Nuclear Norms (Q5369251) (← links)
- Well-Posedness in Unconstrained Polynomial Optimization Problems (Q5741069) (← links)
- Separability of Hermitian tensors and PSD decompositions (Q5888855) (← links)
- Strong duality in lasserre's hierarchy for polynomial optimization (Q5963686) (← links)
- Homogenization for polynomial optimization with unbounded sets (Q6044977) (← links)
- Algebraic optimization of sequential decision problems (Q6051114) (← links)
- A hierarchy of spectral relaxations for polynomial optimization (Q6062883) (← links)
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations (Q6066099) (← links)
- A unified framework for the identification of a general class of multivariable nonlinear block‐structured systems (Q6071510) (← links)
- Optimality conditions for homogeneous polynomial optimization on the unit sphere (Q6097490) (← links)
- Dehomogenization for completely positive tensors (Q6107957) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization (Q6136658) (← links)
- A utopia point method-based robust vector polynomial optimization scheme (Q6154404) (← links)
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials (Q6159023) (← links)
- Generalized truncated moment problems with unbounded sets (Q6159298) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- Exponential Convergence of Sum-of-Squares Hierarchies for Trigonometric Polynomials (Q6176427) (← links)
- Invariants of SDP exactness in quadratic programming (Q6184179) (← links)
- On continuous selections of polynomial functions (Q6198506) (← links)
- Second Order Conditions to Decompose Smooth Functions as Sums of Squares (Q6202760) (← links)