Pages that link to "Item:Q847843"

The following pages link to Semidefinite representation of convex sets (Q847843):

Displaying 50 items.

• Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials (Q2279398) (← links)
• On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
• Characterizations of mixed binary convex quadratic representable sets (Q2316624) (← links)
• On \(p\)-norm linear discrimination (Q2356201) (← links)
• Convex sets with semidefinite representation (Q2391000) (← links)
• Three-dimensional polyhedra can be described by three polynomial inequalities (Q2391196) (← links)
• Algebraic boundaries of \(\mathrm{SO}(2)\)-orbitopes (Q2391832) (← links)
• A bounded degree SOS hierarchy for polynomial optimization (Q2397758) (← links)
• Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
• Semidefinite descriptions of cones defining spectral mask constraints (Q2572890) (← links)
• The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra (Q2628331) (← links)
• Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint (Q2663356) (← links)
• Convex generalized Nash equilibrium problems and polynomial optimization (Q2693649) (← links)
• Sums of squares characterizations of containment of convex semialgebraic sets (Q2789157) (← links)
• Matrix convex hulls of free semialgebraic sets (Q2790584) (← links)
• Semidefinite Representation of Convex Sets and Convex Hulls (Q2802520) (← links)
• The computational complexity of duality (Q2832893) (← links)
• Convex Hulls of Quadratically Parameterized Sets With Quadratic Constraints (Q2849467) (← links)
• LMI Representations of Convex Semialgebraic Sets and Determinantal Representations of Algebraic Hypersurfaces: Past, Present, and Future (Q2849473) (← links)
• On New Classes of Nonnegative Symmetric Tensors (Q2968174) (← links)
• Chapter 6: Semidefinite Representability (Q2978418) (← links)
• On Sum of Squares Representation of Convex Forms and Generalized Cauchy--Schwarz Inequalities (Q3295879) (← links)
• (Q4557933) (← links)
• On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets (Q4571879) (← links)
• Spectrahedral Shadows (Q4603029) (← links)
• Semidefinite Approximation of Closed Convex Set (Q4613906) (← links)
• Polynomial Norms (Q4620456) (← links)
• A new proof for the existence of degree bounds for Putinar’s Positivstellensatz (Q4635365) (← links)
• Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
• Lifting for Simplicity: Concise Descriptions of Convex Sets (Q5044992) (← links)
• Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems (Q5045170) (← links)
• The Geometry of Discotopes (Q5101850) (← links)
• Semidefinite Optimization Estimating Bounds on Linear Functionals Defined on Solutions of Linear ODEs (Q5153670) (← links)
• A new class of alternative theorems for SOS-convex inequalities and robust optimization (Q5175328) (← links)
• A Matrix Positivstellensatz with Lifting Polynomials (Q5210520) (← links)
• Stochastic polynomial optimization (Q5210742) (← links)
• Semidefinite Representations of Noncompact Convex Sets (Q5252601) (← links)
• A Semidefinite Hierarchy for Containment of Spectrahedra (Q5254998) (← links)
• Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (Q5258947) (← links)
• Generic Spectrahedral Shadows (Q5259828) (← links)
• Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs (Q5376453) (← links)
• Semidefinite Descriptions of the Convex Hull of Rotation Matrices (Q5501229) (← links)
• Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization (Q5742692) (← links)
• On duality gap with polynomial multipliers for polynomial optimization problems (Q5879569) (← links)
• Learning Dynamical Systems with Side Information (Q5883299) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
• Linear optimization over homogeneous matrix cones (Q6047504) (← links)
• Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (Q6103695) (← links)
• Sum-of-squares relaxations in robust DC optimization and feature selection (Q6142071) (← links)