Pages that link to "Item:Q2848175"

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to A complete characterization of the gap between convexity and sos-convexity (Q2848175):

Displaying 41 items.

Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
On cones of nonnegative quartic forms (Q525602) (← links)
A convex polynomial that is not sos-convex (Q715094) (← links)
Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization (Q1653325) (← 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)
A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
Second-order cone programming relaxations for a class of multiobjective convex polynomial problems (Q2150767) (← links)
New examples of extremal positive linear maps (Q2173326) (← links)
On the complexity of detecting convexity over a box (Q2191776) (← links)
On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← 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)
On Sum of Squares Representation of Convex Forms and Generalized Cauchy--Schwarz Inequalities (Q3295879) (← links)
(Q4557933) (← links)
Polynomial Norms (Q4620456) (← links)
Time-Varying Semidefinite Programs (Q4958555) (← links)
Further results on sum-of-squares tensors (Q5038186) (← 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)
On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty (Q5069193) (← links)
A new class of alternative theorems for SOS-convex inequalities and robust optimization (Q5175328) (← links)
Convergence guarantees for a class of non-convex and non-smooth optimization problems (Q5214248) (← links)
Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs (Q5376453) (← links)
On duality gap with polynomial multipliers for polynomial optimization problems (Q5879569) (← links)
Sum-of-squares relaxations in robust DC optimization and feature selection (Q6142071) (← links)
Characterizing a class of robust vector polynomial optimization via sum of squares conditions (Q6161553) (← links)
On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems (Q6200383) (← links)
Robust second order cone conditions and duality for multiobjective problems under uncertainty data (Q6203549) (← links)
A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs (Q6536842) (← links)
On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials (Q6550977) (← links)
Higher-order Newton methods with polynomial work per iteration (Q6608710) (← links)