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):
Displaying 15 items.
- 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)
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms (Q3565458) (← links)
- Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm (Q4924117) (← links)
- Convex Maximization via Adjustable Robust Optimization (Q5106408) (← links)
- A General Regularized Continuous Formulation for the Maximum Clique Problem (Q5108235) (← links)
- Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem (Q5116545) (← links)
- A sufficient conditions for global quadratic optimization (Q5147640) (← links)
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925734) (← links)
- Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925735) (← links)
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (Q5963229) (← links)
- A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees (Q6114780) (← links)
- A quadratic simplex algorithm for primal optimization over zero-one polytopes (Q6202952) (← links)
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem (Q6617001) (← links)
