Pages that link to "Item:Q5929997"

The following pages link to On copositive programming and standard quadratic optimization problems (Q5929997):

Displaying 33 items.

• Multi-standard quadratic optimization: Interior point methods and cone programming reformulation (Q2379693) (← links)
• On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
• Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← links)
• Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball (Q2458903) (← links)
• Algorithmic copositivity detection by simplicial partition (Q2477530) (← links)
• D.C. versus copositive bounds for standard QP (Q2583183) (← links)
• Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
• Generating irreducible copositive matrices using the stable set problem (Q2664002) (← links)
• Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
• The CP-Matrix Approximation Problem (Q2790067) (← links)
• Copositive Programming (Q2802526) (← links)
• Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
• Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) (← links)
• Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty (Q2957465) (← links)
• Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
• A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
• Fast Cluster Detection in Networks by First Order Optimization (Q5065475) (← links)
• Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
• A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems (Q5110556) (← links)
• Completely positive and copositive program modelling for quadratic optimization problems (Q5151542) (← links)
• Foundations of Set-Semidefinite Optimization (Q5188753) (← links)
• Optimality conditions for linear copositive programming problems with isolated immobile indices (Q5207739) (← links)
• A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
• On Degenerate Doubly Nonnegative Projection Problems (Q5868954) (← links)
• Completely positive factorization by a Riemannian smoothing method (Q6043135) (← links)
• A Sum of Squares Characterization of Perfect Graphs (Q6087752) (← links)
• Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
• Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
• (Global) optimization: historical notes and recent developments (Q6114910) (← links)
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
• Performance comparison of two recently proposed copositivity tests (Q6114943) (← links)
• Approximation hierarchies for copositive cone over symmetric cone and their comparison (Q6122328) (← links)
• Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 (Q6170529) (← links)