Pages that link to "Item:Q3778558"
From MaRDI portal
The following pages link to Some NP-complete problems in quadratic and nonlinear programming (Q3778558):
Displaying 50 items.
- UTA-poly and UTA-splines: additive value functions with polynomial marginals (Q1681484) (← links)
- A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686) (← links)
- Improved approximation results on standard quartic polynomial optimization (Q1686564) (← links)
- Open weak CAD and its applications (Q1711996) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- A robust unscented transformation for uncertain moments (Q1738657) (← links)
- Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system (Q1744121) (← links)
- Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- A new conic approach to semisupervised support vector machines (Q1793456) (← links)
- On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
- Note on combinatorial optimization with max-linear objective functions (Q1803670) (← links)
- The impact of accelerating tools on the interval subdivision algorithm for global optimization (Q1804056) (← links)
- Quadratic-programming criteria for copositive matrices (Q1823293) (← links)
- A continuous approach to nonlinear integer programming (Q1824556) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- Criteria for copositive matrices using simplices and barycentric coordinates (Q1893079) (← links)
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives (Q1904655) (← links)
- Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs (Q1906278) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
- Algebra -- 9. Translated from the Russian (Q1977412) (← links)
- On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems (Q2007822) (← links)
- Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
- A simplex algorithm for rational cp-factorization (Q2020599) (← links)
- The extreme rays of the \(6\times 6\) copositive cone (Q2022227) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Maximizing perturbation radii for robust convex quadratically constrained quadratic programs (Q2030501) (← links)
- Discriminant analysis of distributional data via fractional programming (Q2031090) (← links)
- Partially distributed outer approximation (Q2046262) (← links)
- Stability of the linear complementarity problem properties under interval uncertainty (Q2051193) (← links)
- A modified simplex partition algorithm to test copositivity (Q2052385) (← links)
- Fast incremental expectation maximization for finite-sum optimization: nonasymptotic convergence (Q2058782) (← links)
- Newton polytopes and relative entropy optimization (Q2067684) (← links)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- Complexity aspects of local minima and related notions (Q2074805) (← links)
- An adaptive high order method for finding third-order critical points of nonconvex optimization (Q2079692) (← links)
- On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint (Q2089778) (← links)
- On the complexity of finding a local minimizer of a quadratic function over a polytope (Q2089789) (← links)
- Feedback control design using sum of squares optimisation (Q2095324) (← links)
- A game-theoretic perspective of deep neural networks (Q2098170) (← links)
- An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint (Q2104089) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- An active-set algorithm for norm constrained quadratic problems (Q2133422) (← links)
- A game-theoretic analysis of deep neural networks (Q2151381) (← links)
