Pages that link to "Item:Q847843"
From MaRDI portal
The following pages link to Semidefinite representation of convex sets (Q847843):
Displaying 50 items.
- Real algebraic geometry with a view toward systems control and free positivity. Abstracts from the workshop held April 6--12, 2014. (Q347197) (← links)
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms (Q457226) (← links)
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
- Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
- Free semidefinite representation of matrix power functions (Q471947) (← links)
- Determinantal representations and Bézoutians (Q510007) (← links)
- Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
- On cones of nonnegative quartic forms (Q525602) (← links)
- Convex hulls of curves of genus one (Q645211) (← links)
- First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials (Q662299) (← links)
- A convex polynomial that is not sos-convex (Q715094) (← links)
- Smooth hyperbolicity cones are spectrahedral shadows (Q745684) (← links)
- Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
- Semidefinite representation of convex sets (Q847843) (← links)
- On semidefinite representations of non-closed sets (Q968981) (← links)
- Tropically convex constraint satisfaction (Q1635805) (← links)
- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization (Q1653325) (← links)
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
- Maximum semidefinite and linear extension complexity of families of polytopes (Q1702780) (← links)
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data (Q1743539) (← links)
- DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers (Q1756794) (← links)
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints (Q1785470) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
- NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
- The tropical analogue of the Helton-Nie conjecture is true (Q1994125) (← links)
- On the exactness of Lasserre relaxations and pure states over real closed fields (Q2007851) (← links)
- An introduction to matrix convex sets and free spectrahedra (Q2008156) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- Linear operators and positive semidefiniteness of symmetric tensor spaces (Q2018916) (← links)
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← links)
- Complexity aspects of local minima and related notions (Q2074805) (← links)
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty (Q2108799) (← links)
- Distributionally robust optimization with moment ambiguity sets (Q2111170) (← links)
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems (Q2150767) (← links)
- Kurdyka-Łojasiewicz exponent via inf-projection (Q2162122) (← links)
- Sum-of-squares methods for controlled invariant sets with applications to model-predictive control (Q2178207) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations (Q2257075) (← links)
- Characterizing robust solution sets of convex programs under data uncertainty (Q2260682) (← links)
- 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)
