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.
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations (Q721169) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← links)
- Solution to nonconvex quadratic programming with both inequality and box constraints (Q833456) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Toward unified analysis and controller synthesis for a class of hybrid systems (Q854127) (← links)
- Considering manufacturing cost and scheduling performance on a CNC turning machine (Q856225) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Scheduling parallel CNC machines with time/cost trade-off considerations (Q875425) (← links)
- Extensions of Gauss quadrature via linear programming (Q896553) (← links)
- Deciding positivity of multisymmetric polynomials (Q898286) (← links)
- Cardinality constrained portfolio selection problem: a completely positive programming approach (Q898723) (← links)
- A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
- Active constraints, indefinite quadratic test problems, and complexity (Q911993) (← links)
- The computational complexity of evolutionarily stable strategies (Q926196) (← links)
- Algorithms for determining the copositivity of a given symmetric matrix (Q959864) (← links)
- Optimization and analysis of the profitability of tariff structures with two-part tariffs (Q976514) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- Solutions to quadratic minimization problems with box and integer constraints (Q989896) (← links)
- Copositive Lyapunov functions for switched systems over cones (Q1015029) (← links)
- Approachability in repeated games: Computational aspects and a Stackelberg variant (Q1021600) (← links)
- Efficient heuristics for inventory placement in acyclic networks (Q1025232) (← links)
- On the computation of \(C^*\) certificates (Q1037359) (← links)
- Checking local optimality in constrained quadratic programming is NP- hard (Q1102861) (← links)
- Local optimization on graphs (Q1122503) (← links)
- On computational complexity of invalidating structured uncertainty models (Q1128693) (← links)
- Quadratic programming with one negative eigenvalue is NP-hard (Q1177910) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- Local minima for indefinite quadratic knapsack problems (Q1186274) (← links)
- An optimality criterion for global quadratic optimization (Q1187846) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- A new technique for generating quadratic programming test problems (Q1315416) (← links)
- A finite algorithm for solving general quadratic problems (Q1315437) (← links)
- Using copositivity for global optimality criteria in concave quadratic programming problems (Q1319026) (← links)
- Detecting all evolutionarily stable strategies (Q1321259) (← links)
- Role of copositivity in optimality criteria for nonconvex optimization problems (Q1321274) (← links)
- A branch bound method for subset sum problem (Q1343509) (← links)
- Complexity issues in robust stability of linear delay-differential systems (Q1356632) (← links)
- Minimum distance to the complement of a convex set: Duality result (Q1379954) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- Investigations in topology. 9. Work collection (Q1575790) (← links)
- Conditionally definite matrices (Q1576008) (← links)
- Bitopologies on products and ratios (Q1576016) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
- Constrained optimization with integer and continuous variables using inexact restoration and projected gradients (Q1653960) (← links)
- LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← links)
- Nested nonnegative cone analysis (Q1663282) (← links)
- Distributionally robust chance constrained problem under interval distribution information (Q1670537) (← links)
- Copositivity detection of tensors: theory and algorithm (Q1673917) (← links)
