Pages that link to "Item:Q1281478"
From MaRDI portal
The following pages link to On standard quadratic optimization problems (Q1281478):
Displaying 50 items.
- Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization (Q332770) (← links)
- A copositive formulation for the stability number of infinite graphs (Q344928) (← links)
- Sparse solutions to random standard quadratic optimization problems (Q378104) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- An improved algorithm to test copositivity (Q427387) (← links)
- Standard bi-quadratic optimization problems and unconstrained polynomial reformulations (Q427394) (← links)
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming (Q472338) (← links)
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization (Q496589) (← links)
- A first-order interior-point method for linearly constrained smooth optimization (Q535018) (← links)
- Improving an upper bound on the stability number of a graph (Q556012) (← links)
- Properties of two DC algorithms in quadratic programming (Q628748) (← links)
- A class of differential quadratic programming problems (Q670795) (← links)
- On admissible efficient portfolio selection problem (Q702651) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- A clique algorithm for standard quadratic programming (Q955308) (← links)
- Optimal algorithms and intuitive explanations for Markowitz's portfolio selection model and Sharpe's ratio with no short-selling (Q1042804) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Dominant-set clustering: a review (Q1754006) (← links)
- Solidity indices for convex cones (Q1928255) (← links)
- Unconstrained formulation of standard quadratic optimization problems (Q1935878) (← links)
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
- Characterizing existence of minimizers and optimality to nonconvex quadratic integrals (Q2031964) (← links)
- Two-stage stochastic standard quadratic optimization (Q2077956) (← links)
- A study on sequential minimal optimization methods for standard quadratic problems (Q2095525) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- On sparsity of the solution to a random quadratic optimization problem (Q2227539) (← links)
- Two methods for the maximization of homogeneous polynomials over the simplex (Q2231046) (← links)
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
- Simple complexity from imitation games (Q2268119) (← links)
- Linear vs. quadratic portfolio selection models with hard real-world constraints (Q2355713) (← links)
- Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121) (← links)
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation (Q2379693) (← links)
- A new method for mean-variance portfolio optimization with cardinality constraints (Q2393351) (← links)
- Solving cardinality constrained mean-variance portfolio problems via MILP (Q2400005) (← links)
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint (Q2413092) (← links)
- Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior (Q2420824) (← links)
- On admissible efficient portfolio selection policy (Q2572364) (← links)
- Quartic formulation of standard quadratic optimization problems (Q2576445) (← links)
- Using SVM to combine global heuristics for the standard quadratic problem (Q2629704) (← links)
- Generating irreducible copositive matrices using the stable set problem (Q2664002) (← links)
- A reformulation-linearization technique for optimization over simplices (Q2689826) (← links)
- New bounds for nonconvex quadratically constrained quadratic programming (Q2689857) (← links)
- Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves (Q2832889) (← links)
- On the accuracy of uniform polyhedral approximations of the copositive cone (Q2885468) (← links)
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex (Q2954391) (← links)
- The fundamental theorem of linear programming: extensions and applications (Q2996803) (← links)
