Pages that link to "Item:Q1942256"

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 NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256):

Displaying 46 items.

Amoebas, nonnegative polynomials and sums of squares supported on circuits (Q268411) (← links)
Maximum entropy methods as the bridge between microscopic and macroscopic theory (Q343948) (← links)
Global optimization test problems based on random field composition (Q523165) (← links)
On cones of nonnegative quartic forms (Q525602) (← links)
A convex polynomial that is not sos-convex (Q715094) (← links)
Testing pseudoconvexity via interval computation (Q721159) (← links)
Deciding positivity of multisymmetric polynomials (Q898286) (← links)
A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
Positive signs in massive gravity (Q1638479) (← links)
Optimality conditions and optimization methods for quartic polynomial optimization (Q1646197) (← links)
Self-concordance is NP-hard (Q1675557) (← links)
DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
Linear interval parametric approach to testing pseudoconvexity (Q2022238) (← links)
Complexity aspects of local minima and related notions (Q2074805) (← links)
Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere (Q2080815) (← links)
Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere (Q2144547) (← links)
A survey of hidden convex optimization (Q2176821) (← links)
Sum-of-squares methods for controlled invariant sets with applications to model-predictive control (Q2178207) (← links)
On the complexity of detecting convexity over a box (Q2191776) (← links)
On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977) (← links)
On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
On the convexity bound of the generalized Drucker's yield function CB2001 for orthotropic sheets (Q2234613) (← links)
On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
On the triality theory for a quartic polynomial optimization problem (Q2358857) (← links)
On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
Geometric control of hybrid systems (Q2677099) (← links)
Some computable quasiconvex multiwell models in linear subspaces without rank-one matrices (Q2696695) (← links)
Conditions of convexity of a quartic form with parallelepiped symmetry (Q2780430) (← links)
On New Classes of Nonnegative Symmetric Tensors (Q2968174) (← links)
Extended Formulations in Mixed-Integer Convex Programming (Q3186495) (← links)
Polynomial Norms (Q4620456) (← links)
ON THE DIFFICULTY OF DECIDING THE CONVEXITY OF POLYNOMIALS OVER SIMPLEXES (Q4889508) (← links)
Optimization on the Euclidean Unit Sphere (Q5087107) (← links)
Minimization of even conic functions on the two-dimensional integral lattice (Q5090143) (← links)
A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization (Q5131958) (← links)
Convergence guarantees for a class of non-convex and non-smooth optimization problems (Q5214248) (← links)
Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems (Q5247613) (← links)
A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
On the estimation of Pareto front and dimensional similarity in many-objective evolutionary algorithm (Q6086270) (← links)
A new technique to derive tight convex underestimators (sometimes envelopes) (Q6155069) (← links)
An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials (Q6181366) (← links)
How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← 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)