Pages that link to "Item:Q1102861"
From MaRDI portal
The following pages link to Checking local optimality in constrained quadratic programming is NP- hard (Q1102861):
Displayed 50 items.
- Piecewise convex maximization problems: Piece adding technique (Q535077) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- Global optimization over a box via canonical dual function (Q609201) (← links)
- Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method (Q651143) (← links)
- Open questions in complexity theory for numerical optimization (Q687097) (← links)
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard (Q694182) (← links)
- Maximization of generalized convex functionals in locally convex spaces. (Q703177) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Objective function features providing barriers to rapid global optimization (Q813354) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- Solution to nonconvex quadratic programming with both inequality and box constraints (Q833456) (← links)
- A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
- Active constraints, indefinite quadratic test problems, and complexity (Q911993) (← links)
- Solutions to quadratic minimization problems with box and integer constraints (Q989896) (← links)
- Quadratic programming with one negative eigenvalue is NP-hard (Q1177910) (← links)
- An optimality criterion for global quadratic optimization (Q1187846) (← links)
- Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← links)
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem (Q1200636) (← links)
- Parallel computing in nonconvex programming (Q1309859) (← links)
- A new technique for generating quadratic programming test problems (Q1315416) (← links)
- A finite algorithm for solving general quadratic problems (Q1315437) (← links)
- Role of copositivity in optimality criteria for nonconvex optimization problems (Q1321274) (← links)
- A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
- Descent approaches for quadratic bilevel programming (Q1331096) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- Global optimality conditions for fixed charge quadratic programs (Q1670551) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Generalized \(\gamma\)-valid cut procedure for concave minimization (Q1807817) (← 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)
- Exact solution approach for a class of nonlinear bilevel knapsack problems (Q2018478) (← links)
- On the complexity of finding a local minimizer of a quadratic function over a polytope (Q2089789) (← links)
- Optimality conditions for maximizing a function over a polyhedron (Q2248749) (← links)
- Invex optimization revisited (Q2274856) (← links)
- On the solution of concave knapsack problems (Q2276878) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- A logarithmic descent direction algorithm for the quadratic knapsack problem (Q2287590) (← links)
- A dynamic inventory model with supplier selection in a serial supply chain structure (Q2355942) (← links)
- Methods for convex and general quadratic programming (Q2356335) (← links)
- On second order conditions for equality constrained extremum problems (Q2453045) (← links)
- Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis. (Q2477109) (← links)
- Solving a combined cutting-stock and lot-sizing problem with a column generating procedure (Q2482385) (← links)
- Second-order sufficient optimality conditions for local and global nonlinear programming (Q2564610) (← links)
- Block pivoting and shortcut strategies for detecting copositivity (Q2564929) (← links)
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs (Q2574101) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems (Q3200891) (← links)